Pages that link to "Item:Q6071077"
From MaRDI portal
The following pages link to A heuristic for the convex recoloring problem in graphs (Q6071077):
Displaying 6 items.
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Improving graph colouring algorithms and heuristics using a novel representation (Q1742608) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)