Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
Summary: Introducing Reducing-Peeling, a linear-time framework that builds large independent sets by reducing low-degree vertices and peeling high-degree ones when needed. LinearTime and NearLinear apply novel reduction rules to beat prior linear-time MIS methods and accelerate iterated local search. (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. Wei Li (University of New South Wales)
- 3. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@inproceedings{chang_sigmod17,
title = {{Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling}},
author = {Chang, Lijun and Li, Wei and Zhang, Wenjie},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3035939},
url = {https://dl.acm.org/doi/10.1145/3035918.3035939},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,981 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 6.329157e-05 |
| 6,965 | BSX : Subgraph Matching with Batch Backtracking Search | 2025 | SIGMOD | 5.6328006e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 645 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015213733 |
| 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.0001505607 |
| 1,647 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 9.9875545e-05 |
| 3,934 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.9172713e-05 |
| 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.0472942e-05 |
| 6,961 | Towards Maximum Independent Sets on Massive Graphs | 2015 | VLDB | 5.6332537e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 2 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 3 | 4,981 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB |
| 4 | 10,665 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 5 | 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 6 | 3,328 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 7 | 5,720 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 8 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 9 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 10 | 6,961 | Towards Maximum Independent Sets on Massive Graphs | 2015 | VLDB |