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: 5675
Venue: SIGMOD
Year: 2019
Pagerank: 8.8813183e-05
Overall Rank: 2,243 | 84.62%
DOI: 10.1145/3299869.3300082

Incoming Non-self Citations Over Time

Authors

1. Yikai Zhang (Chinese University of Hong Kong)
2. Jeffrey Xu Yu (Chinese University of Hong Kong)

BibTeX Citation

@inproceedings{zhang_sigmod19,
        title = {{Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs}},
        author = {Zhang, Yikai and Yu, Jeffrey Xu},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3300082},
        url = {https://dl.acm.org/doi/10.1145/3299869.3300082},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 18 of 18 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,647	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	0.00010125633
3,503	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.3592701e-05
4,681	Influential Community Search over Large Heterogeneous Information Networks	2023	VLDB	6.5665144e-05
4,921	Effective Community Search over Large Star-Schema Heterogeneous Information Networks	2022	VLDB	6.4448544e-05
5,977	Maximal D-truss Search in Dynamic Directed Graphs	2023	VLDB	6.0219619e-05
6,368	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.8975125e-05
7,408	Efficient Triangle-Connected Truss Community Search In Dynamic Graphs	2023	VLDB	5.6243648e-05
8,011	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.5074939e-05
8,149	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	5.4784885e-05
9,553	Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs	2025	VLDB	5.2528121e-05
9,690	Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks	2025	VLDB	5.2351259e-05
9,695	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.2351259e-05
10,423	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	5.093636e-05
10,448	Efficient Influential Community Search over Dynamic Graphs	2026	SIGMOD	5.093636e-05
10,478	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	5.093636e-05
10,528	Effective Durable Community Search in Large Temporal Graph	2026	VLDB	5.093636e-05
10,656	A Local Search Approach to Efficient (k, p)-Core Maintenance	2025	SIGMOD	5.093636e-05
11,825	Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice	2020	VLDB	5.093636e-05

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
102	Truss Decomposition in Massive Networks	2012	VLDB	0.00034255289
189	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026114928
956	Parallelizing Sequential Graph Computations	2017	SIGMOD	0.0001297452
1,069	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012323497
1,296	Incremental Graph Pattern Matching	2011	SIGMOD	0.00011269684
1,416	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010839488
2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1976617e-05
2,798	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD	8.1129891e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,954	Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach	2025	VLDB
2	8,991	Truss-based Community Search over Streaming Directed Graphs	2024	VLDB
3	10,478	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD
4	10,671	Minimum Spanning Tree Maintenance in Dynamic Graphs	2025	SIGMOD
5	9,387	Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs	2024	VLDB
6	102	Truss Decomposition in Massive Networks	2012	VLDB
7	2,798	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD
8	4,443	Incrementalizing Graph Algorithms	2021	SIGMOD
9	2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB
10	8,011	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD