Convex recoloring of paths
From MaRDI portal
Publication:2448880
DOI10.1016/J.DAM.2013.02.034zbMATH Open1288.05095OpenAlexW2172993755MaRDI QIDQ2448880FDOQ2448880
Authors: Karla Roberta Lima, Yoshiko Wakabayashi 
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.034
Recommendations
Trees (05C05) Approximation algorithms (68W25) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Efficient approximation of convex recolorings
- Convex recoloring of paths
- Connected Coloring Completion for General Graphs: Algorithms and Complexity
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Algorithms and Data Structures
- The Complexity of Minimum Convex Coloring
- Approximation and Online Algorithms
Cited In (14)
- Integer programming models and polyhedral study for the geodesic classification problem on graphs
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- Quadratic kernelization for convex recoloring of trees
- Quadratic Kernelization for Convex Recoloring of Trees
- 1.5-approximation algorithm for the 2-convex recoloring problem
- 1.5-approximation algorithm for the 2-convex recoloring problem
- Hardness and inapproximability of convex recoloring problems
- Convex recoloring of paths
- STACS 2004
- An extended formulation of the convex recoloring problem on a tree
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
- Strong intractability results for generalized convex recoloring problems
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Column generation approach to the convex recoloring problem on a tree
This page was built for publication: Convex recoloring of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448880)
