Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints

@inproceedings{Ahn2015AccessTD,
  title={Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints},
  author={Kook Jin Ahn and Sudipto Guha},
  booktitle={SPAA},
  year={2015}
}
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges m and the access to input data is constrained. These questions arises in many natural settings, and in particular in the analysis of MapReduce or similar algorithms that model constrained parallelism with sublinear central processing. In SPAA 2011, Lattanzi etal. provided a O(1) approximation of maximum… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

Round compression for parallel matching algorithms

STOC • 2018
View 9 Excerpts
Highly Influenced

Graph stream algorithms: a survey

SIGMOD Record • 2014
View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…