Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs

19 January 2021

Papers citing "Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs"

8 / 8 papers shown

Title
Improved All-Pairs Approximate Shortest Paths in Congested Clique Hong Duc Bui Shashwat Chandra Yi-Jun Chang Michal Dory Dean Leitersdorf 28 1 0 04 May 2024
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model Pierre Fraigniaud Mael Luce Ioan Todinca 14 2 0 05 Apr 2023
Deterministic Near-Optimal Distributed Listing of Cliques K. Censor-Hillel Dean Leitersdorf David Vulakh 8 9 0 18 May 2022
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 19 14 0 13 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques K. Censor-Hillel Orr Fischer Franccois Le Gall Dean Leitersdorf R. Oshman GNN 11 22 0 09 Jan 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 24 6 0 02 Oct 2021
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 27 4 0 14 Sep 2021
Local certification of graph decompositions and applications to minor-free classes Nicolas Bousquet Laurent Feuilloley Théo Pierron 13 22 0 30 Jul 2021