A Survey of Graph Algorithms Under Extended Streaming Models of Computation

DOI10.1007/978-1-4020-9688-4_17zbMath1191.68323OpenAlexW1590701623MaRDI QIDQ5192369

Thomas C. O'Connell

Publication date: 5 August 2009

Published in: Fundamental Problems in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9688-4_17

zbMATH Keywords

graph algorithmscommunication complexitystreamingstream-sort

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

Finding Articulation Points of Large Graphs in Linear Time ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Depth First Search in the Semi-streaming Model

This page was built for publication: A Survey of Graph Algorithms Under Extended Streaming Models of Computation