Pages that link to "Item:Q5323087"
From MaRDI portal
The following pages link to Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087):
Displaying 12 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Convex recoloring of paths (Q2448880) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- Convex Recoloring of Paths (Q2840702) (← links)
- Heuristics for the connected assignment problem in arrays (Q6092548) (← links)
