Efficient Maximum k-Plex Computation over Large Sparse Graphs
Summary: Presents kPlexS: iteratively extracts small dense subgraphs from large sparse graphs and solves each via branch-and-bound for scalable maximum k-plex computation. Novel CTCP exhaustively reduces vertices/edges (iteratively applied) and BBMatrix uses adjacency-matrix first- and second-order reductions/upper bounds with incremental updates; empirically outperforms BnB, Maplex, and KpLeX. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang
- 2. Mouyi Xu
- 3. Darren Strash
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,696 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3673968e-05 |
| 6,813 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 4.9187137e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1945683e-05 |
| 10,136 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD | 4.1945683e-05 |
| 10,646 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 847 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015993322 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011322927 |
| 4,145 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4122551e-05 |
| 4,270 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.3067205e-05 |
| 5,124 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 5.6795646e-05 |
| 6,813 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 4.9187137e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7867286e-05 |
| 10,646 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 4.1945683e-05 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 5,696 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3673968e-05 |