Pages that link to "Item:Q2741266"
From MaRDI portal
The following pages link to Using an incomplete version of dynamic backtracking for graph colouring (Q2741266):
Displaying 5 items.
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Coloration neighbourhood search with forward checking (Q1601930) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Efficient constraint propagation for graph coloring (Q2840716) (← links)
- A theoretical analysis of backtracking in the graph coloring problem (Q3736910) (← links)