Algorithms and Data Structures
From MaRDI portal
Publication:5394252
DOI10.1007/11534273zbMath1123.68094OpenAlexW3010016474MaRDI QIDQ5394252
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem ⋮ Efficient approximation of convex recolorings ⋮ An extended formulation of the convex recoloring problem on a tree ⋮ Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems ⋮ A Survey on the Complexity of Flood-Filling Games ⋮ Convex recoloring of paths ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ Testing convexity properties of tree colorings ⋮ Upper and lower bounds for finding connected motifs in vertex-colored graphs ⋮ Tractability and hardness of flood-filling games on trees ⋮ The convex recoloring problem: polyhedra, facets and computational experiments
This page was built for publication: Algorithms and Data Structures
