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
- 2. Kai Yao
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,396 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3399748e-05 |
| 9,404 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3399748e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-05 |
| 10,654 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 106 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048373761 |
| 865 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015775653 |
| 1,029 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00014568714 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011002771 |
| 4,085 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 6.4580586e-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 |
| 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 |
Previous
Page 1 / 1
Next