ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.09061
  4. Cited By
Triangle Finding and Listing in CONGEST Networks

Triangle Finding and Listing in CONGEST Networks

25 May 2017
Taisuke Izumi
F. Gall
ArXivPDFHTML

Papers citing "Triangle Finding and Listing in CONGEST Networks"

16 / 16 papers shown
Title
Deterministic Expander Routing: Faster and More Versatile
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang
Shang-En Huang
Hsin-Hao Su
43
2
0
06 May 2024
What Can We Compute in a Single Round of the Congested Clique?
What Can We Compute in a Single Round of the Congested Clique?
Peter Robinson
30
4
0
06 Oct 2022
Computing Power of Hybrid Models in Synchronous Networks
Computing Power of Hybrid Models in Synchronous Networks
Pierre Fraigniaud
Pedro Montealegre
Pablo Paredes
I. Rapaport
Martín Ríos-Wilson
Ioan Todinca
24
2
0
04 Aug 2022
Deterministic Near-Optimal Distributed Listing of Cliques
Deterministic Near-Optimal Distributed Listing of Cliques
K. Censor-Hillel
Dean Leitersdorf
David Vulakh
23
9
0
18 May 2022
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and Challenges
K. Censor-Hillel
30
14
0
13 Mar 2022
Sparse Matrix Multiplication in the Low-Bandwidth Model
Sparse Matrix Multiplication in the Low-Bandwidth Model
Chetan Gupta
J. Hirvonen
Janne H. Korhonen
Jan Studený
Jukka Suomela
16
4
0
02 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques
Quantum Distributed Algorithms for Detection of Cliques
K. Censor-Hillel
Orr Fischer
Franccois Le Gall
Dean Leitersdorf
R. Oshman
GNN
16
23
0
09 Jan 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing
Lower Bounds for Induced Cycle Detection in Distributed Computing
Franccois Le Gall
Masayuki Miyamoto
24
6
0
02 Oct 2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
K. Censor-Hillel
Orr Fischer
T. Gonen
F. Gall
Dean Leitersdorf
R. Oshman
109
26
0
19 Jan 2021
Tight Distributed Listing of Cliques
Tight Distributed Listing of Cliques
K. Censor-Hillel
Yi-Jun Chang
Franccois Le Gall
Dean Leitersdorf
28
20
0
14 Nov 2020
Distributed Detection of Cliques in Dynamic Networks
Distributed Detection of Cliques in Dynamic Networks
Matthias Bonne
K. Censor-Hillel
GNN
19
12
0
25 Apr 2019
Detecting cliques in CONGEST networks
Detecting cliques in CONGEST networks
A. Czumaj
C. Konrad
11
35
0
03 Jul 2018
Superlinear Lower Bounds for Distributed Subgraph Detection
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer
T. Gonen
R. Oshman
18
1
0
18 Nov 2017
Distributed Subgraph Detection
Distributed Subgraph Detection
Pierre Fraigniaud
Pedro Montealegre
Dennis Olivetti
I. Rapaport
Ioan Todinca
13
11
0
13 Jun 2017
Deterministic subgraph detection in broadcast CONGEST
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen
Joel Rybicki
29
52
0
29 May 2017
On the Distributed Complexity of Large-Scale Graph Computations
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
25
53
0
26 Feb 2016
1