Research map / Graph learning / Graph algorithms and clustering
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs
Hua Jiang, Chu-Min Li, Felip Manya
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| add preprocessing of first-level subgraphs (ablation) | WLMC · soc-flickr-und | search time (s): 4274 -> 329.8 | Improved |
| add incremental vertex-weight splitting (UP&Split) (ablation) | WLMC · soc-flickr-und | search time (s): 5970 -> 329.8 | Improved |
| add incremental vertex-weight splitting (UP&Split) (ablation) | WLMC · soc-flickr-und | search tree size (thousands): 212938 -> 741.1 | Improved |
| add preprocessing of first-level subgraphs (ablation) | WLMC · 6 hard graphs | instances solved within cutoff | Improved |
| add incremental vertex-weight splitting (UP&Split) (ablation) | WLMC · 6 hard graphs | instances solved within cutoff | Improved |
| add preprocessing of first-level subgraphs (ablation) | WLMC · easy graphs (e.g. soc-orkut) | search time (s): 66.83 -> 100.2 | Hurt |
| add incremental vertex-weight splitting (UP&Split) (ablation) | WLMC · easy graphs (e.g. scc twitter-copen) | search time (s): 42.41 -> 95.89 | Hurt |
| use exact WLMC instead of heuristic solvers (ablation) | WLMC · large real-world graphs (52 reported) | solved to optimum | Improved |
| use WLMC instead of heuristic LSCC+BMS (ablation) | WLMC · DIMACS graphs >1000 vertices | best weight: 7341 vs 9072 on C1000.9 | Mixed |
Closest papers by meaning
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.92)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.89)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.88)
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 2025 · similarity 0.87)
- Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs (AAAI 2025 · similarity 0.86)
- Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better (ICML 2024 · similarity 0.86)
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.
