Database Paper Browser

Back to papers

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)

Paper ID
5613
Venue
SIGMOD
Year
2019
Pagerank
8.0234377e-05
Overall Rank
2,846 | 80.21%
DOI
10.1145/3299869.3300082

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 18 of 18 citing papers.

Rank Citing Paper Year Venue Pagerank
2,286 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.0982591e-05
3,975 Accelerating Truss Decomposition on Heterogeneous Processors 2020 VLDB 6.5736847e-05
5,513 Effective Community Search over Large Star-Schema Heterogeneous Information Networks 2022 VLDB 5.4641695e-05
5,610 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 5.4118541e-05
6,725 Maximal D-truss Search in Dynamic Directed Graphs 2023 VLDB 4.9484066e-05
6,880 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 4.8970985e-05
8,014 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 4.6058845e-05
8,169 Efficient Triangle-Connected Truss Community Search In Dynamic Graphs 2023 VLDB 4.5698941e-05
10,134 A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs 2026 SIGMOD 4.1945683e-05
10,159 Efficient Influential Community Search over Dynamic Graphs 2026 SIGMOD 4.1945683e-05
10,189 Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs 2026 SIGMOD 4.1945683e-05
10,240 Effective Durable Community Search in Large Temporal Graph 2026 VLDB 4.1945683e-05
10,363 A Local Search Approach to Efficient (k, p)-Core Maintenance 2025 SIGMOD 4.1945683e-05
10,553 Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks 2025 VLDB 4.1945683e-05
10,865 Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs 2025 VLDB 4.1945683e-05
10,947 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 4.1945683e-05
11,042 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 4.1945683e-05
11,630 Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice 2020 VLDB 4.1945683e-05
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