Pages that link to "Item:Q5960033"
From MaRDI portal
The following pages link to Constraint propagation in graph coloring (Q5960033):
Displaying 7 items.
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- Efficient constraint propagation for graph coloring (Q2840716) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)