Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
Summary: Index-based optimal algorithms for Steiner components with maximum connectivity (SMCC) using a novel index; runtime linear in the result size. Supports size-constrained SMCC, connectivity-only metrics, batch processing, and incremental updates; experiments show speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of New South Wales)
- 2. Xuemin Lin (East China Normal University; University of New South Wales)
- 3. Lu Qin (University of Technology Sydney)
- 4. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 5. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@inproceedings{chang_sigmod15,
title = {{Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity}},
author = {Chang, Lijun and Lin, Xuemin and Qin, Lu and Yu, Jeffrey Xu and Zhang, Wenjie},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2746486},
url = {https://dl.acm.org/doi/10.1145/2723372.2746486},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00023084332 |
| 273 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022671795 |
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022620623 |
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 3,119 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB | 7.7370163e-05 |
| 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.1809407e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 2 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 3 | 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD |
| 4 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 5 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 6 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 7 | 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 8 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 9 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 10 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |