Towards Maximum Independent Sets on Massive Graphs
Summary: Studies MIS in the semi-external model, where vertices fit in RAM but edges reside on disk. A greedy algorithm plus vertex-swap framework uses few sequential scans, achieving near-optimal solutions on 59M-vertex graphs with 469MB memory. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yu Liu (Renmin University of China)
- 2. Jiaheng Lu (University of Helsinki)
- 3. Hua Yang (Renmin University of China)
- 4. Xiaokui Xiao (Nanyang Technological University)
- 5. Zhewei Wei (Renmin University of China)
BibTeX Citation
@article{liu_vldb15,
title = {{Towards Maximum Independent Sets on Massive Graphs}},
author = {Liu, Yu and Lu, Jiaheng and Yang, Hua and Xiao, Xiaokui and Wei, Zhewei},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {13},
doi = {10.14778/2831360.2831366},
url = {https://doi.org/10.14778/2831360.2831366},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,764 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD | 5.5499989e-05 |
| 8,212 | PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs | 2019 | SIGMOD | 5.4658632e-05 |
| 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 5.2434488e-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,553 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.0001037809 |
| 1,622 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010201102 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 2 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 3 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 5 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 6 | 7,522 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS |
| 7 | 7,578 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB |
| 8 | 594 | Massive Graph Triangulation | 2013 | SIGMOD |
| 9 | 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD |
| 10 | 7,764 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD |