A Survey on Streaming Algorithms for Massive Graphs
Author:
- 18 January 2010
- book chapter
- Published by Springer Nature
- p. 393-420
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- What's hot and what's not: tracking most frequent items dynamicallyACM Transactions on Database Systems, 2005
- Finding frequent items in data streamsTheoretical Computer Science, 2004
- External memory algorithms and data structuresACM Computing Surveys, 2001
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Near-Linear Time Construction of Sparse Neighborhood CoversSIAM Journal on Computing, 1998
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- Edges in graphs with large girthGraphs and Combinatorics, 1991
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985
- Selection and sorting with limited storageTheoretical Computer Science, 1980
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969