Pages that link to "Item:Q2840716"
From MaRDI portal
The following pages link to Efficient constraint propagation for graph coloring (Q2840716):
Displaying 6 items.
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Using an incomplete version of dynamic backtracking for graph colouring (Q2741266) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- Propagation Rules for Graph Partitioning Constraints (Q5739848) (← links)
- Constraint propagation in graph coloring (Q5960033) (← links)