Research map / Graph learning / Graph algorithms and clustering
Reduction and Local Search for Weighted Graph Coloring Problem
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 RedLS (reduction + CC local search) instead of AFISA | RedLS · Conventional benchmarks (59 hard instances) | MIN weight: better on 48 of 59 instances, worse on 2 | Helped |
| use RedLS instead of AFISA | RedLS · Massive graphs w1 | MIN weight: better on 60 of 65 instances, equal on 5 | Helped |
| use RedLS instead of AFISA, MWSS, 2Phase | RedLS · Massive graphs w2 | instances with better min solution: 60(60) vs 0(0) | Helped |
| add clique-sampling reduction rule | RedLS · conventional benchmarks | vertices reduced: 12.45 vertices on average | No clear effect |
| add clique-sampling reduction rule | RedLS · Massive graphs w1 | percent vertices removed: 60.59% removed on average | Helped |
| replace CC-WGCP with tabu tenure 5 (ablation) | RedLS · rec-dating and sc-rel9 | objective over time | Hurt |
| replace CC-WGCP with tabu tenure 20 (ablation) | RedLS · rec-dating and sc-rel9 | objective over time | Hurt |
| replace CC-WGCP with tabu tenure 80 (ablation) | RedLS · rec-dating and sc-rel9 | objective over time | Hurt |
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.86)
- 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.83)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.83)
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 2025 · similarity 0.83)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.82)
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.