Author:
Moura Phablo F.S.,Wakabayashi Yoshiko
Funder
CNPq
FAPESP
CAPES
Universidade Estadual de Campinas
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. R. Bar-Yehuda, G. Kutiel, D. Rawitz, 1.5-approximation algorithm for the 2-convex recoloring problem, in: Proceedings of IWOCA 2015, pp. 299–311.
2. The convex recoloring problem: polyhedra, facets and computational experiments;Campêlo;Mathematical Programming,2016
3. Hardness and inapproximability of convex recoloring problems;Campêlo;Theoretical Computer Science,2014
4. An extended formulation of the convex recoloring problem on a tree;Chopra;Mathematical Programming,2016
5. Connected coloring completion for general graphs: Algorithms and complexity;Chor;Lecture Notes in Computer Science,2007