All Papers

0 / 0 papers shown

Title

Title
A Survey of Distributed Graph Algorithms on Massive Graphs Lingkai Meng Yu Shao Long Yuan Longbin Lai Peng Cheng Xue Li Wenyuan Yu Wenjie Zhang Xuemin Lin Jingren Zhou 185 28 0 09 Apr 2024
What Can We Compute in a Single Round of the Congested Clique? Peter Robinson 259 4 0 06 Oct 2022
Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022 K. Censor-Hillel 164 13 0 13 Mar 2022
Finding Subgraphs in Highly Dynamic NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 K. Censor-Hillel V. I. Kolobov Gregory Schwartzman 155 6 0 17 Sep 2020
Parallel Batch-Dynamic $k$ -Clique CountingSIAM Symposium on Algorithmic Principles of Computer Systems (SAPCS), 2020 Laxman Dhulipala Quanquan C. Liu Julian Shun Shangdi Yu 193 31 0 30 Mar 2020
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 69 1 0 01 Mar 2020

Title

A Survey of Distributed Graph Algorithms on Massive Graphs

Jingren Zhou

185

09 Apr 2024

What Can We Compute in a Single Round of the Congested Clique?

Peter Robinson

259

06 Oct 2022

Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022

K. Censor-Hillel

164

13 Mar 2022

Finding Subgraphs in Highly Dynamic NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020

K. Censor-Hillel

V. I. Kolobov

Gregory Schwartzman

155

17 Sep 2020

Parallel Batch-Dynamic

k

-Clique CountingSIAM Symposium on Algorithmic Principles of Computer Systems (SAPCS), 2020

193

30 Mar 2020

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

01 Mar 2020

Title
A Survey of Distributed Graph Algorithms on Massive Graphs Lingkai Meng Yu Shao Long Yuan Longbin Lai Peng Cheng Xue Li Wenyuan Yu Wenjie Zhang Xuemin Lin Jingren Zhou 185 28 0 09 Apr 2024
What Can We Compute in a Single Round of the Congested Clique? Peter Robinson 259 4 0 06 Oct 2022
Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022 K. Censor-Hillel 164 13 0 13 Mar 2022
Finding Subgraphs in Highly Dynamic NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 K. Censor-Hillel V. I. Kolobov Gregory Schwartzman 155 6 0 17 Sep 2020
Parallel Batch-Dynamic $k$ -Clique CountingSIAM Symposium on Algorithmic Principles of Computer Systems (SAPCS), 2020 Laxman Dhulipala Quanquan C. Liu Julian Shun Shangdi Yu 193 31 0 30 Mar 2020
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 69 1 0 01 Mar 2020