The following pages link to Algorithms and Data Structures (Q5394252):
Displaying 10 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- Convex recoloring of paths (Q2448880) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
