Maximum k-Plex Finding: Choices of Pruning Techniques Matter!
Summary: U-MkP unifies branching, upper-bounding, and reduction techniques from nine maximum k-plex solvers. Experiments show pruning choices are highly k-sensitive, expose overstated techniques, identify a key unreported booster for k>5, and support variants and parallelization. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Akhlaque Ahmad (Indiana University)
- 2. Da Yan (Indiana University)
- 3. Xiao Chen (Indiana University)
- 4. Lyuheng Yuan (Indiana University)
- 5. Qin Zhang (Indiana University)
- 6. Saugat Adhikari (Indiana University)
BibTeX Citation
@article{ahmad_vldb25,
title = {{Maximum k-Plex Finding: Choices of Pruning Techniques Matter!}},
author = {Ahmad, Akhlaque and Yan, Da and Chen, Xiao and Yuan, Lyuheng and Zhang, Qin and Adhikari, Saugat},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {9},
pages = {2928--2940},
doi = {10.14778/3746405.3746418},
url = {https://doi.org/10.14778/3746405.3746418},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.0862742e-05 |
| 5,197 | Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach | 2021 | VLDB | 6.3229492e-05 |
| 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 6.2061433e-05 |
| 8,478 | T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph | 2023 | SIGMOD | 5.4170414e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 2 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 3 | 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB |
| 4 | 7,032 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD |
| 5 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 6 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 7 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 8 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 9 | 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB |
| 10 | 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |