Efficient Maximum k-Plex Computation over Large Sparse Graphs
Summary: kPlexS computes exact maximum k-plexes in large sparse graphs by repeatedly extracting small dense subgraphs and applying branch-and-bound. CTCP reductions and matrix-based BBMatrix exploit vertex/edge and pairwise structure, outperforming prior methods empirically. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
- 2. Mouyi Xu (University of Sydney)
- 3. Darren Strash (Hamilton College)
BibTeX Citation
@article{chang_vldb23,
title = {{Efficient Maximum k-Plex Computation over Large Sparse Graphs}},
author = {Chang, Lijun and Xu, Mouyi and Strash, Darren},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {2},
pages = {127--139},
doi = {10.14778/3565816.3565817},
url = {https://doi.org/10.14778/3565816.3565817},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 6.2061433e-05 |
| 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 5.9336489e-05 |
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.2528121e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 10,425 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD | 5.093636e-05 |
| 10,898 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 102 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034255289 |
| 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00010539891 |
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB |
| 2 | 3,613 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 3 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 4 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 5 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 6 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 7 | 10,898 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB |
| 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 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |