Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs
Summary: Under locally persistent model, truss maintenance on evolving graphs is bounded for removals but unbounded for insertions. Proposes AFF, an affected-edge set, enabling bounded insertion with O(f(||AFF||_c)); beats full recompute on 12 graphs by up to 1e3x. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yikai Zhang
- 2. Jeffrey Xu Yu
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 444 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.00022987918 |
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 1,720 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010779343 |
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 2,512 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB | 8.6196023e-05 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,975 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB | 4.4179255e-05 |
| 10,710 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 4.1945683e-05 |
| 10,189 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 9,239 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 4.3690661e-05 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 5,292 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 5.5816687e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 8,014 | Efficient Star-based Truss Maintenance on Dynamic Graphs | 2023 | SIGMOD | 4.6058845e-05 |