Maximum k-Plex Computation: Theory and Practice
Summary: Introduces kPlexT, a two-stage exact max k-plex solver with new reductions and branching, lowering the exponential base to gamma_k. Theoretical bounds depend on alpha and max degree Delta; kPlexT gives practical performance and applies to quasi-cliques and k-biplexes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
- 2. Kai Yao (University of Sydney)
BibTeX Citation
@inproceedings{chang_sigmod24,
title = {{Maximum k-Plex Computation: Theory and Practice}},
author = {Chang, Lijun and Yao, Kai},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639318},
url = {https://dl.acm.org/doi/10.1145/3639318},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 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 |
| 9,677 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.1435978e-05 |
| 9,678 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.1435978e-05 |
| 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 11,296 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 100 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00033977856 |
| 988 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00012660447 |
| 1,507 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00010450256 |
| 1,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010066712 |
| 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.5528776e-05 |
| 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 6.5021632e-05 |
| 5,291 | Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach | 2021 | VLDB | 6.192515e-05 |
| 5,500 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 6.1028678e-05 |
| 7,043 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 5.6141221e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 2 | 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 3 | 11,296 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB |
| 4 | 4,526 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 5 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 6 | 9,678 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB |
| 7 | 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 8 | 1,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 9 | 6,914 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 10 | 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |