Dynamic Algorithms for the Massively Parallel Computation Model
Open Access
- 17 June 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 49-58
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Villum Fonden (16582)
This publication has 22 references indexed in Scilit:
- Optimal Dynamic Distributed MIS2016
- Fast Connected Components Computation in Large Graphs by Vertex PruningIEEE Transactions on Parallel and Distributed Systems, 2016
- Parallel algorithms for geometric graph problems2014
- Communication steps for parallel query processing2013
- Fully Dynamic Maximal Matching in O (log n) Update Time2011
- Sorting, Searching, and Simulation in the MapReduce Framework2011
- A new approach to dynamic all pairs shortest pathsJournal of the ACM, 2004
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivityJournal of the ACM, 2001
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973