Pages that link to "Item:Q4015385"
From MaRDI portal
The following pages link to A Pruning Procedure for Exact Graph Coloring (Q4015385):
Displaying 22 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- An exact graph coloring algorithm using color exchange (Q1374088) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- 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)
- An exact method for graph coloring (Q2489282) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- Constraint propagation in graph coloring (Q5960033) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
