Towards Maximum Independent Sets on Massive Graphs
Summary: Introduces semi-external MIS for graphs where vertices fit in memory but edges do not. Greedy plus a vertex-swap framework incrementally enlarges MIS using only a few sequential disk scans, enabling in-memory computation on disk-resident graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yu Liu
- 2. Jiaheng Lu
- 3. Hua Yang
- 4. Xiaokui Xiao
- 5. Zhewei Wei
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,664 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD | 4.6805647e-05 |
| 8,231 | PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs | 2019 | SIGMOD | 4.5489304e-05 |
| 9,485 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 4.3300131e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,822 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.00010404349 |
| 1,843 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010340277 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7811667e-05 |
| 3,857 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6924202e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1905499e-05 |
| 865 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015775653 |
| 5,041 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS | 5.7356447e-05 |
| 7,714 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB | 4.6651585e-05 |
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 7,664 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD | 4.6805647e-05 |