Using an Incomplete Version of Dynamic Backtracking for Graph Colouring

DOI10.1016/S1571-0653(04)00007-1zbMath1039.90530OpenAlexW2050503951MaRDI QIDQ2741266

Steven Prestwich

Publication date: 23 September 2001

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00007-1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Cites Work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using an Incomplete Version of Dynamic Backtracking for Graph Colouring