Abstract
Given a graph with an arbitrary vertex coloring, the Convex Recoloring Problem (CR) consists of recoloring the minimum number of vertices so that each color induces a connected subgraph. We focus on the complexity and inapproximabiliy of this problem on k-colored graphs, for fixed k ≥ 2. We prove a very strong complexity result showing that CR is already NP-hard on k-colored grids, and therefore also on planar graphs with maximum degree 4. For each k ≥ 2, we also prove that, for a positive constant c, there is no cln n-approximation algorithm even for k-colored n-vertex bipartite graphs, unless P = NP. For 2-colored (q,q − 4)-graphs, a class that includes cographs and P 4-sparse graphs, we present polynomial-time algorithms for fixed q. The same complexity results are obtained for a relaxation of CR, where only one fixed color is required to induce a connected subgraph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2, 153–177 (2006)
Babel, L., Olariu, S.: On the structure of graphs with few P 4′s. Discrete Appl. Math. 84, 1–13 (1998)
Baumann, S.: A linear algorithm for the homogeneous decomposition of graphs, Report No. M-9615, Zentrum für Mathematik, Technische Universität München (1996)
Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theor. Comp. Sys. 43, 3–18 (2008)
Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A., Weyer, M.: Quadratic kernelization for convex recoloring of trees. Algorithmica 61(2), 362–388 (2011)
Campêlo, M.B., Lima, K.R., Moura, P.F.S., Wakabayashi, Y.: Polyhedral studies on the convex recoloring problem (2012), accepted to VII Latin-American Algorithms, Graphs and Optimization Symposium (2013)
Chor, B., Fellows, M., Ragan, M.A., Razgon, I., Rosamond, F., Snir, S.: Connected coloring completion for general graphs: Algorithms and complexity. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 75–85. Springer, Heidelberg (2007)
Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem in NP-complete. SIAM Journal of Applied Mathematics 32, 826–834 (1977)
Kammer, F., Tholey, T.: The complexity of minimum convex coloring. Discrete Appl. Math. 160, 810–833 (2012)
Kanj, I.A., Kratsch, D.: Convex recoloring revisited: Complexity and exact algorithms. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 388–397. Springer, Heidelberg (2009)
Jamison, B., Olariu, S.: A tree representation for P 4-sparse graphs. Discrete Appl. Math. 35, 115–129 (1992)
Lima, K.R., Wakabayashi, Y.: Convex recoloring of paths. Electronic Notes in Discrete Mathematics 37, 165–170 (2011)
Moran, S., Snir, S.: Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73, 1078–1089 (2007)
Moran, S., Snir, S.: Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74, 850–869 (2008)
Moran, S., Snir, S., Sung, W.-K.: Partial convex recolorings of trees and galled networks: tight upper and lower bounds. ACM Trans. Algorithms 7 (2011)
Ponta, O., Hüffner, F., Niedermeier, R.: Speeding up dynamic programming for some NP-hard graph recoloring problems. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 490–501. Springer, Heidelberg (2008)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th Annual ACM Symposium on Theory of Computing, pp. 475–484 (1997)
Razgon, I.: A \(2\sp{O(k)}{\rm poly}(n)\) algorithm for the parameterized convex recoloring problem. Inform. Process. Lett. 104(2), 53–58 (2007)
Sales, C.L., Maia, A.K., Martins, N., Sampaio, R.M.: Restricted Coloring Problems on graphs with few P 4’s. Annals of Operations Research (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campêlo, M.B., Huiban, C.G., Sampaio, R.M., Wakabayashi, Y. (2013). On the Complexity of Solving or Approximating Convex Recoloring Problems. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)