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
- 2. Wei Li
- 3. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,318 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 4.7583643e-05 |
| 7,456 | BSX : Subgraph Matching with Batch Backtracking Search | 2025 | SIGMOD | 4.7205339e-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 |
|---|---|---|---|---|
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 1,125 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.00013829006 |
| 1,843 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010340277 |
| 4,070 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4739921e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 6,877 | Towards Maximum Independent Sets on Massive Graphs | 2015 | VLDB | 4.8945769e-05 |
Previous
Page 1 / 1
Next