Pages that link to "Item:Q2446103"
From MaRDI portal
The following pages link to Hardness and inapproximability of convex recoloring problems (Q2446103):
Displayed 6 items.
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)