ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.04898
  4. Cited By
Faster and Simpler Distributed Algorithms for Testing and Correcting
  Graph Properties in the CONGEST-Model

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model

13 May 2017
G. Even
Reut Levi
Moti Medina
ArXiv (abs)PDFHTML

Papers citing "Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model"

7 / 7 papers shown
Distributed Testing of Graph Isomorphism in the CONGEST model
Distributed Testing of Graph Isomorphism in the CONGEST modelInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2020
Reut Levi
Moti Medina
131
1
0
01 Mar 2020
Distributed Detection of Cliques in Dynamic Networks
Distributed Detection of Cliques in Dynamic Networks
Matthias Bonne
K. Censor-Hillel
GNN
195
12
0
25 Apr 2019
Property Testing of Planarity in the CONGEST model
Property Testing of Planarity in the CONGEST model
Reut Levi
Moti Medina
D. Ron
201
15
0
27 May 2018
Superlinear Lower Bounds for Distributed Subgraph Detection
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer
T. Gonen
R. Oshman
295
1
0
18 Nov 2017
Deterministic subgraph detection in broadcast CONGEST
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen
Joel Rybicki
236
55
0
29 May 2017
Distributed Testing of Excluded Subgraphs
Distributed Testing of Excluded Subgraphs
Pierre Fraigniaud
I. Rapaport
Ville Salo
Ioan Todinca
231
37
0
12 May 2016
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and
  Low-Stretch Subgraphs
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch SubgraphsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011
G. Blelloch
Anupam Gupta
I. Koutis
Gary Miller
Richard Peng
Kanat Tangwongsan
251
35
0
07 Nov 2011
1
Page 1 of 1