Research map / Graph learning / Graph algorithms and clustering
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Maplex instead of BnBk | exact maximum k-plex solving on Network Repository graphs · Network Repository graphs, k = 2, 3, 4, and 5 | instances solved within 1800s: 17 more instances | Helped |
| Use second-order preprocessing instead of subgraph-reduction preprocessing | Maplex preprocessing · 13 hard graphs, k = 2 | preprocessing speed: 4x-10x | Helped |
| Remove the color-bound and lookahead components (ablation) | Maplex branch-and-bound · kernel graphs from the preprocessing experiments | branching nodes: up to an order of magnitude | Hurt |
| Add second-order edge reduction to first-order vertex reduction | Maplex preprocessing · large real-world graphs, including soc-pokec and socfb-A-anon | vertices remaining after preprocessing: two orders of magnitude | Helped |
Closest papers by meaning
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.87)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.86)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.86)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.85)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.85)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.