A Survey of Graph Algorithms Under Extended Streaming Models of Computation

DOI10.1007/978-1-4020-9688-4_17MaRDI QIDQ5192369zbMATH OpenOpenAlexFDO

Authors 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

communication complexitygraph algorithmsstream-sortstreaming

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• On graph problems in a semi-streaming model
• Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
• Adapting parallel algorithms to the W-stream model, with applications to graph problems
• Semi-streaming algorithms for annotated graph streams

Cited in

(9)

• Dynamic graph stream algorithms in \(o(n)\) space
• Graph sketching and streaming: new approaches for analyzing massive graphs
• Streamed Graph Drawing and the File Maintenance Problem
• Finding articulation points of large graphs in linear time
• Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
• Adapting parallel algorithms to the W-stream model, with applications to graph problems
• Graph connectivity in log steps using label propagation
• Depth First Search in the Semi-streaming Model
• Graph spanners in the streaming model: An experimental study

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192369)