Pages that link to "Item:Q3608833"
From MaRDI portal
The following pages link to Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833):
Displaying 17 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← 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)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Convex recoloring of paths (Q2448880) (← links)
- Convex recoloring of paths (Q2840702) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
- A heuristic for the convex recoloring problem in graphs (Q6071077) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)