Pages that link to "Item:Q3502673"
From MaRDI portal
The following pages link to Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673):
Displayed 9 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)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← 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)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)