Trading off space for passes in graph streaming problems

DOI10.1145/1109557.1109635zbMath1192.05080OpenAlexW4245136207MaRDI QIDQ5901127

Irene Finocchi, Andrea Ribichini, Camil Demetrescu

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109635

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (8)

New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory ⋮ New bounds for the CLIQUE-GAP problem using graph decomposition theory ⋮ Data mining of social networks represented as graphs ⋮ Buyback Problem - Approximate Matroid Intersection with Cancellation Costs ⋮ Best-order streaming model ⋮ Approximate shortest paths guided by a small index ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Trading off space for passes in graph streaming problems