LIPIcs.MFCS.2023.80.pdf
- Filesize: 0.65 MB
- 15 pages
Document
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work
Authors
-
Part of:
Volume:
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-21
File
Document Identifiers
Acknowledgements
We are grateful to Jens Keppeler and Christopher Spinrath for careful proof reading.
Cite AsGet BibTex
Jonas Schmidt and Thomas Schwentick. Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 80:1-80:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.MFCS.2023.80
https://doi.org/10.4230/LIPIcs.MFCS.2023.80
Abstract
The paper proposes dynamic parallel algorithms for connectivity and bipartiteness of undirected graphs that require constant time and 𝒪(n^{1/2+ε}) work on the CRCW PRAM model. The work of these algorithms almost matches the work of the 𝒪(log n) time algorithm for connectivity by Kopelowitz et al. (2018) on the EREW PRAM model and the time of the sequential algorithm for bipartiteness by Eppstein et al. (1997). In particular, we show that the sparsification technique, which has been used in both mentioned papers, can in principle also be used for constant time algorithms in the CRCW PRAM model, despite the logarithmic depth of sparsification trees.
Subject Classification
ACM Subject Classification
- Theory of computation → Dynamic graph algorithms
- Theory of computation → Parallel algorithms
Keywords
- Dynamic parallel algorithms
- Undirected connectivity
- Bipartiteness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, and Thatchaphol Saranurak. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1158-1167, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00111.
- Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, and Thomas Zeume. Reachability is in DynFO. J. ACM, 65(5):33:1-33:24, 2018. URL: https://doi.org/10.1145/3212685.
-
Guozhu Dong and Jianwen Su. First-order incremental evaluation of datalog queries. In Database Programming Languages (DBPL-4), Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages, pages 295-308, 1993.
-
David Eppstein, Zvi Galil, Giuseppe F. Italiano, and Amnon Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM, 44(5):669-696, 1997.
- Greg N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput., 14(4):781-798, 1985. URL: https://doi.org/10.1137/0214055.
- Kathrin Hanauer, Monika Henzinger, and Christian Schulz. Recent advances in fully dynamic graph algorithms (invited talk). In James Aspnes and Othon Michail, editors, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND), pages 1:1-1:47, 2022. URL: https://doi.org/10.4230/LIPIcs.SAND.2022.1.
- Scott Huddleston and Kurt Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157-184, 1982. URL: https://doi.org/10.1007/BF00288968.
-
N. Immerman. Expressibility and parallel complexity. SIAM J. Comput., 18:625-638, 1989.
- Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, and Nikos Parotsidis. Dynamic algorithms for the massively parallel computation model. In Christian Scheideler and Petra Berenbrink, editors, The 31st ACM on Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 49-58, 2019. URL: https://doi.org/10.1145/3323165.3323202.
-
Joseph F. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
- Jens Keppeler, Thomas Schwentick, and Christopher Spinrath. Work-efficient query evaluation with prams. In Floris Geerts and Brecht Vandevoort, editors, 26th International Conference on Database Theory (ICDT), pages 16:1-16:20, 2023. URL: https://doi.org/10.4230/LIPIcs.ICDT.2023.16.
- Tsvi Kopelowitz, Ely Porat, and Yair Rosenmutter. Improved worst-case deterministic parallel dynamic minimum spanning forest. In Christian Scheideler and Jeremy T. Fineman, editors, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 333-341, 2018. URL: https://doi.org/10.1145/3210377.3210403.
- Sushant Patnaik and Neil Immerman. Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci., 55(2):199-209, 1997. URL: https://doi.org/10.1006/jcss.1997.1520.
- Thomas Schwentick, Nils Vortmeier, and Thomas Zeume. Sketches of dynamic complexity. SIGMOD Rec., 49(2):18-29, 2020. URL: https://doi.org/10.1145/3442322.3442325.
-
Peter van Emde Boas. Machine models and simulation. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 1-66. Elsevier and MIT Press, 1990.