On finding common neighborhoods in massive graphs.
From MaRDI portal
Publication:1874417
DOI10.1016/S0304-3975(02)00569-8zbMath1042.68086MaRDI QIDQ1874417
Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Intractability of min- and max-cut in streaming graphs ⋮ New results for finding common neighborhoods in massive graphs in the data stream model ⋮ Depth First Search in the Semi-streaming Model ⋮ On graph problems in a semi-streaming model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic counting algorithms for data base applications
- Selection and sorting with limited storage
- The space complexity of approximating the frequency moments
- New asymptotics for bipartite Turán numbers
- Authoritative sources in a hyperlinked environment
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Communication Complexity