Back to papers
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method
Summary: AltRB alternately partitions branches and interleaves reduction and bounding with new rules to more aggressively prune BRB search for maximum k-plex. In kPEX with preprocessing, AltRB yields up to 100× speedups and solves more instances than prior BRB methods.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13989
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.3399748e-05
- Overall Rank
- 9,404 | 34.65%
- DOI
-
10.14778/3705829.3705851
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 106 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048373761 |
| 284 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029014359 |
| 1,650 |
Efficient Enumeration of Maximal k-Plexes |
2015 |
SIGMOD |
0.00011002771 |
| 2,230 |
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs |
2021 |
SIGMOD |
9.2389629e-05 |
| 2,527 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.5982912e-05 |
| 4,085 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
6.4580586e-05 |
| 4,737 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9529218e-05 |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7811667e-05 |
| 5,021 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7481039e-05 |
| 5,125 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
5.6741053e-05 |
| 5,148 |
Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach |
2021 |
VLDB |
5.6572863e-05 |
| 5,709 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5.3622436e-05 |
| 5,909 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
5.2722596e-05 |
| 6,530 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0197442e-05 |
| 7,109 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
4.8238188e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,527 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.5982912e-05 |
| 4,266 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.3006582e-05 |
| 10,074 |
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space |
2026 |
SIGMOD |
4.1905499e-05 |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7811667e-05 |
| 6,811 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9139947e-05 |
| 5,125 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
5.6741053e-05 |
| 10,654 |
Maximum k-Plex Finding: Choices of Pruning Techniques Matter! |
2025 |
VLDB |
4.1905499e-05 |
| 1,650 |
Efficient Enumeration of Maximal k-Plexes |
2015 |
SIGMOD |
0.00011002771 |
| 5,709 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5.3622436e-05 |
| 4,085 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
6.4580586e-05 |