A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs

Summary: Unified maintenance framework for dense subgraphs on dynamic bipartite graphs via an (alpha,beta)-core (bi-core) abstraction. Key novelty: maintenance equivalence across k-core/k-truss/bi-truss/k-nucleus plus onion-layer and kappaBCO indexes, yielding bounded, batch-update maintenance with reduced space. (summarized by gpt-5-mini on Apr 11 2026)

Paper ID: 7635
Venue: SIGMOD
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,423 | 28.49%
DOI: 10.1145/3786618

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Zitan Sun (Hong Kong Baptist University)
2. Zihan Jia (Hong Kong Baptist University)
3. Hong Cheng (Chinese University of Hong Kong)
4. Xin Huang (Hong Kong Baptist University)
5. Jeffrey Xu Yu (Hong Kong University of Science and Technology)

BibTeX Citation

@inproceedings{sun_sigmod26,
        title = {{A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs}},
        author = {Sun, Zitan and Jia, Zihan and Cheng, Hong and Huang, Xin and Yu, Jeffrey Xu},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786618},
        url = {https://dl.acm.org/doi/10.1145/3786618},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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
590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.0001605572
1,113	Approximate Closest Community Search in Networks	2016	VLDB	0.00012124571
1,328	Truss-based Community Search over Large Directed Graphs	2020	SIGMOD	0.00011140898
2,243	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.8813183e-05
3,855	Distributed D-core Decomposition over Large Directed Graphs	2022	VLDB	7.0712144e-05
3,993	Efficient k-Clique Listing: An Edge-Oriented Branching Strategy	2024	SIGMOD	6.9688824e-05
4,143	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.8760066e-05
4,672	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD	6.5731244e-05
5,674	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	6.1255689e-05
6,268	Theoretically and Practically Efficient Maximum Defective Clique Search	2024	SIGMOD	5.9336489e-05
8,011	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.5074939e-05
8,991	Truss-based Community Search over Streaming Directed Graphs	2024	VLDB	5.3377754e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,011	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD
2	10,273	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD
3	2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB
4	5,697	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB
5	8,149	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB
6	10,100	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB
7	9,689	Density Decomposition of Bipartite Graphs	2025	SIGMOD
8	10,478	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD
9	2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB
10	5,674	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD