Pages that link to "Item:Q639283"
From MaRDI portal
The following pages link to Quadratic kernelization for convex recoloring of trees (Q639283):
Displaying 6 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
