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
- 1. Luca Becchetti (Sapienza University)
- 2. Andrea Clementi (University of Roma Tre)
- 3. Luciano Gualà (University of Roma Tre)
- 4. Luca Pepè Sciarria (University of Roma Tre)
- 5. Alessandro Straziota (University of Roma Tre)
- 6. Matteo Stromieri (University of Roma Tre)
BibTeX Citation
@article{becchetti_vldb25,
title = {{Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach}},
author = {Becchetti, Luca and Clementi, Andrea and Gualà, Luciano and Sciarria, Luca Pepè and Straziota, Alessandro and Stromieri, Matteo},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {11},
pages = {3937--3950},
doi = {10.14778/3749646.3749665},
url = {https://doi.org/10.14778/3749646.3749665},
year = {2025}
}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 |
|---|---|---|---|---|
| 451 | Mergeable Summaries | 2012 | PODS | 0.00018151445 |
| 458 | Counting Triangles in Data Streams | 2006 | PODS | 0.0001810876 |
| 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.6959807e-05 |
| 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 5.6920203e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 9,967 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB |
| 3 | 5,149 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB |
| 4 | 1,296 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 5 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 6 | 10,845 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB |
| 7 | 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |
| 8 | 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 9 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 10 | 4,443 | Incrementalizing Graph Algorithms | 2021 | SIGMOD |