Pages that link to "Item:Q931727"
From MaRDI portal
The following pages link to Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727):
Displayed 11 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)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Convex Recoloring of Paths (Q2840702) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)