Maximum k-Plex Search: An Alternated Reduction-and-Bound Method
Summary: Introduces AltRB, an alternating reduction/bounding strategy for branch-and-bound maximum k-plex search, replacing sequential RB with partitioned iterative pruning. Combined with new rules and preprocessing, kPEX scales up to 100× faster across 664 graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shuohao Gao (Harbin Engineering University)
- 2. Kaiqiang Yu (Nanyang Technological University)
- 3. Shengxin Liu (Harbin Engineering University)
- 4. Cheng Long (Nanyang Technological University)
BibTeX Citation
@article{gao_vldb25,
title = {{Maximum k-Plex Search: An Alternated Reduction-and-Bound Method}},
author = {Gao, Shuohao and Yu, Kaiqiang and Liu, Shengxin and Long, Cheng},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {2},
pages = {363--376},
doi = {10.14778/3705829.3705851},
url = {https://doi.org/10.14778/3705829.3705851},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2559789e-05 |
| 10,797 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,610 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 2 | 10,797 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB |
| 3 | 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 4 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 5 | 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 6 | 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 7 | 11,296 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB |
| 8 | 1,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 9 | 5,585 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 10 | 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |