Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
From MaRDI portal
Publication:2741266
DOI10.1016/S1571-0653(04)00007-1zbMath1039.90530MaRDI QIDQ2741266
Publication date: 23 September 2001
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
90C35: Programming involving graphs or networks
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, A wide-ranging computational comparison of high-performance graph colouring algorithms
Cites Work