On Estimating Path Aggregates over Streaming Graphs

DOI10.1007/11940128_18zbMATH Open1135.68514OpenAlexW1580699537MaRDI QIDQ5459112FDOQ5459112

Authors: Sumit Ganguly, Barna Saha 

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_18

Recommendations

• Dynamic graph stream algorithms in \(o(n)\) space
• Dynamic graph stream algorithms in \(o(n)\) space
• Graph distances in the streaming model: the value of space
• How hard is counting triangles in the streaming model?

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05)

Cited In (4)

• Approximating Multiple Arrival Streams by Using Aggregation
• A general method for estimating correlated aggregates over a data stream
• A streaming algorithm for the undirected longest path problem
• Intractability of min- and max-cut in streaming graphs

This page was built for publication: On Estimating Path Aggregates over Streaming Graphs

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