Solving the minimum-weighted coloring problem

DOI10.1002/net.1028zbMath0983.68150OpenAlexW2000192838MaRDI QIDQ2748384

Paolo Dell'Olmo, Massimiliano Caramia

Publication date: 14 October 2001

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1028

zbMATH Keywords

weighted coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

Partially concurrent open shop scheduling with integral preemptions, Four decades of research on the open-shop scheduling problem to minimize the makespan, Bounded colouring motivated by the limited resource partially concurrent open shop problem, Unnamed Item

Uses Software

• GraphBase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding maximum cliques in arbitrary and in special graphs
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
• CHECKCOL: improved local search for graph coloring
• A Sufficient Condition for Backtrack-Free Search
• A Pruning Procedure for Exact Graph Coloring
• New methods to color the vertices of a graph
• A Column Generation Approach for Graph Coloring
• A lower bound on the chromatic number of Mycielski graphs