Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach
Summary: Lazy-update algorithm for approximate 2-hop neighborhoods under edge insertions, achieving O(1/ε) amortized updates and relative error ≤ ε for random input sequences. Characterizes adversarial worst-cases (necessitating girth ≤4), empirically confirms robustness on social graphs, and composes with sketches to support neighborhood-size, Jaccard and union/intersection queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 402 | Mergeable Summaries | 2012 | PODS | 0.00024196343 |
| 3,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |
| 6,989 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8716197e-05 |
Previous
Page 1 / 1
Next