The following pages link to Convex recoloring of paths (Q2448880):
Displayed 5 items.
- 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)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)