Distributed and Massively Parallel Graph Algorithms

Project Information

DistMaP

Grant agreement ID: 853109

DOI

10.3030/853109

Project terminated on 31 October 2024

EC signature date 7 October 2019

Start date 1 November 2019

End date 31 October 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 498 250,00

EU contribution

€ 1 498 250,00

Coordinated by

MAX-PLANCK-GESELLSCHAFT ZUR FORDERUNG DER WISSENSCHAFTEN EV
Germany

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (34)

Fully Dynamic Consistent <i>k</i>-Center Clustering

Author(s): Jakub Łącki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhoň
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 3463-3484
Publisher: ACM, Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.124

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Author(s): Vaclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Published in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2023, Page(s) 1114-1121
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00107

Massively Parallel Algorithms for Distance Approximation and Spanners

Author(s): Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović, Yasamin Nazari
Published in: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Publisher: ACM

Undirected (1+ <i></i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms

Author(s): Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Page(s) 478-487
Publisher: ACM
DOI: 10.1145/3519935.3520074

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

Author(s): Michal Dory, Mohsen Ghaffari, Saeed Ilchi
Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2023, Page(s) 292-300
Publisher: ACM
DOI: 10.1145/3519270.3538437

Massively Parallel Algorithms for b-Matching

Author(s): Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrović
Published in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2023, Page(s) 35-44
Publisher: ACM
DOI: 10.1145/3490148.3538589

Massively Parallel Algorithms for Distance Approximation and Spanners

Author(s): Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari; Slobodan Mitrovic; Yasamin Nazari
Published in: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '21), 2021
Publisher: SIAM
DOI: 10.1145/3409964.3461784

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

Author(s): Jan Grebík, Václav Rozhoň
Published in: Proceedings of the EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2021
Publisher: AMUC

Hop-constrained oblivious routing

Author(s): Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Page(s) 1208-1220, ISBN 9781450380539
Publisher: ACM
DOI: 10.1145/3406325.3451098

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs

Author(s): Manuela Fischer, Jeff Giliberti, Christoph Grunau
Published in: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Page(s) 89-100
Publisher: ACM
DOI: 10.1145/3558481.3591081

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Author(s): Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhoň
Published in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2023, Page(s) 1-10
Publisher: ACM
DOI: 10.1145/3490148.3538565

A Time-Optimal Randomized Parallel Algorithm for MIS

Author(s): Mohsen Ghaffari; Bernhard Haeupler
Published in: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '21), 2021
Publisher: SIAM
DOI: 10.1137/1.9781611976465.172

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Author(s): Václav Rozhoň, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Page(s) 321-334
Publisher: ACM
DOI: 10.1145/3564246.3585235

Strong-Diameter Network Decomposition

Author(s): Yi-Jun Chang; Mohsen Ghaffari
Published in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21), Issue 3, 2021
Publisher: SIAM
DOI: 10.1145/3465084.3467933

The Landscape of Distributed Complexities on Trees and Beyond

Author(s): Christoph Grunau, Václav Rozhoň, Sebastian Brandt
Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2023, Page(s) 37-47
Publisher: ACM
DOI: 10.1145/3519270.3538452

Polylogarithmic-time deterministic network decomposition and distributed derandomization

Author(s): Václav Rozhoň, Mohsen Ghaffari
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 350-363, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384298

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

Author(s): Grebík, Jan; Rozhoň, Václav
Published in: European Conference on Combinatorics, Graph Theory and Applications 2021, 2021
Publisher: Birkhauser Cham
DOI: 10.1007/978-3-030-83823-2

Improved Deterministic Network Decomposition

Author(s): Mohsen Ghaffari, Christoph Grunau, Vaclav Rozhon
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 2904-2923
Publisher: SIAM

Improved Deterministic Connectivity in Massively Parallel Computation

Author(s): Fischer, Manuela; Giliberti, Jeff; Grunau, Christoph
Published in: 36th International Symposium on Distributed Computing (DISC 2022), Issue 18, 2022
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.3929/ethz-b-000579756

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

Author(s): Sebastian Brandt, Christoph Grunau, Václav Rozhoň
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 329-338, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405730

Strong-Diameter Network Decomposition

Author(s): Chang, Yi-Jun; Ghaffari, Mohsen
Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing, 2021
Publisher: ACM

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Author(s): Mohsen Ghaffari; Bernhard Haeupler
Published in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21), 2021
Publisher: SIAM
DOI: 10.1145/3465084.3467935

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Author(s): Ghaffari, Mohsen; Haeupler, Bernhard
Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing, 2021
Publisher: ACM

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

Author(s): Brandt, Sebastian; Chang, Yi-Jun; Grebík, Jan; Grunau, Christoph; Rozhoň, Václav; Vidnyánszky, Zoltán
Published in: Innovations of Theoretical Computer Science (ITCS) 2022, 2022
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.29

The randomized local computation complexity of the Lov\'asz local lemma

Author(s): Brandt, Sebastian; Grunau, Christoph; Rozhoň, Václav
Published in: Principles of Distributed Computing (PODC) 2021, 2021
Publisher: SIAM
DOI: 10.1145/3465084.3467931

Massively Parallel Algorithms for Minimum Cut

Author(s): Mohsen Ghaffari, Krzysztof Nowicki
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 119-128, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405737

Distributed MIS with Low Energy and Time Complexities

Author(s): Mohsen Ghaffari, Julian Portmann
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2024, Page(s) 146-156
Publisher: ACM
DOI: 10.1145/3583668.3594587

Improved Deterministic Network Decomposition

Author(s): Ghaffari, Mohsen; Grunau, Christoph; Rozhoň, Václav
Published in: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '21), 2021
Publisher: SIAM
DOI: 10.1137/1.9781611976465.173

k-means++: few more steps yield constant approximation

Author(s): Davin Choo, Christoph Grunau, Julian Portmann, Vaclav Rozhon
Published in: Proceedings of the 37th International Conference on Machine Learning, 2020, Page(s) 1909-1917
Publisher: PMLR

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond

Author(s): Mohsen Ghaffari, Christoph Grunau, Ce Jin
Published in: Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020), 2020, Page(s) 34:1--34:18
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.34

Simple and sharp analysis of k-means||

Author(s): Rozhoň, Václav
Published in: Proceedings of the 37th International Conference on Machine Learning, 2020, Page(s) 8266-8275
Publisher: PMLR

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS

Author(s): Mohsen Ghaffari, Christoph Grunau
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 2148-2179
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00007

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

Author(s): Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tetĕk
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 2099-2130
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00125

A Massively Parallel Algorithm for Minimum Weight Vertex Cover

Author(s): Mohsen Ghaffari, Ce Jin, Daan Nilis
Published in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, Page(s) 259-268, ISBN 9781450369350
Publisher: ACM
DOI: 10.1145/3350755.3400260

Peer reviewed articles (1)

Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics

Author(s): Jan Grebík, Václav Rozhoň
Published in: Advances in Mathematics, Issue 431, 2024, Page(s) 109241, ISSN 0001-8708
Publisher: Academic Press
DOI: 10.1016/j.aim.2023.109241

Book chapters (4)

A Simple Deterministic Distributed Low-Diameter Clustering

Author(s): Václav Rozho, Bernhard Haeupler, Christoph Grunau
Published in: Symposium on Simplicity in Algorithms (SOSA), 2023, Page(s) 166-174
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977585.ch16

Network Decomposition and Distributed Derandomization (Invited Paper)

Author(s): Mohsen Ghaffari
Published in: Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings, Issue 12156, 2020, Page(s) 3-18, ISBN 978-3-030-54920-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-54921-3_1

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond

Author(s): Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhoň
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Page(s) 4409-4447
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch168

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization

Author(s): Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhoň
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Page(s) 2532-2566
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch97