Abstract
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem Q takes as input two feasible solutions S and T and determines if there is a sequence of reconfiguration steps that can be applied to transform S into T such that each step results in a feasible solution to Q. For most of the results in this paper, S and T are subsets of vertices of a given graph and a reconfiguration step adds or deletes a vertex. Our study is motivated by recent results establishing that for most NP-hard problems, the classical complexity of reconfiguration is PSPACE-complete.
We address the question for several important graph properties under two natural parameterizations: k, the size of the solutions, and ℓ, the length of the sequence of steps. Our first general result is an algorithmic paradigm, the reconfiguration kernel, used to obtain fixed-parameter algorithms for the reconfiguration versions of Vertex Cover and, more generally, Bounded Hitting Set and Feedback Vertex Set, all parameterized by k. In contrast, we show that reconfiguring Unbounded Hitting Set is W[2]-hard when parameterized by k + ℓ. We also demonstrate the W[1]-hardness of the reconfiguration versions of a large class of maximization problems parameterized by k + ℓ, and of their corresponding deletion problems parameterized by ℓ; in doing so, we show that there exist problems in FPT when parameterized by k, but whose reconfiguration versions are W[1]-hard when parameterized by k + ℓ.
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.
References
Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. In: Proc. of Latin-American Algorithms Graphs and Optimization Symposium (2013)
Bonsma, P.S., Cereceda, L.: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50), 5215–5226 (2009)
Cereceda, L., van den Heuvel, J., Johnson, M.: Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(56), 913–919 (2008)
Cereceda, L., van den Heuvel, J., Johnson, M.: Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics 30(7), 1593–1606 (2009)
Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. Journal of Graph Theory 67(1), 69–82 (2011)
Ito, T., Kamiński, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics 160(15), 2199–2207 (2012)
Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2), 72–96 (2005)
Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14), 1054–1065 (2011)
Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of boolean satisfiability: computational and structural dichotomies. SIAM J. Comput. 38(6), 2330–2355 (2009)
Bonsma, P.: The complexity of rerouting shortest paths. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 222–233. Springer, Heidelberg (2012)
Kamiński, M., Medvedev, P., Milanič, M.: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39), 5205–5210 (2011)
Haas, R., Seyffarth, K.: The k-Dominating Graph, arXiv:1209.5138 (2012)
Suzuki, A., Mouawad, A.E., Nishimura, N.: Reconfiguration of dominating sets (submitted)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1997)
Bodlaender, H.L.: A cubic kernel for feedback vertex set. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 320–331. Springer, Heidelberg (2007)
Damaschke, P., Molokov, L.: The union of minimal hitting sets: Parameterized combinatorial bounds and counting. Journal of Discrete Algorithms 7(4), 391–401 (2009)
Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Berlin (2006)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20(2), 219–230 (1980)
Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems, arXiv:1308.2409 (2013)
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences 72(8), 1386–1396 (2006)
Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997–1008 (2002)
Fellows, M.R., Rosamond, F.A., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Local search: is brute-force avoidable? In: Proc. of the 21st International Joint Conference on Artifical Intelligence, pp. 486–491 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A. (2013). On the Parameterized Complexity of Reconfiguration Problems. In: Gutin, G., Szeider, S. (eds) Parameterized and Exact Computation. IPEC 2013. Lecture Notes in Computer Science, vol 8246. Springer, Cham. https://doi.org/10.1007/978-3-319-03898-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-03898-8_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03897-1
Online ISBN: 978-3-319-03898-8
eBook Packages: Computer ScienceComputer Science (R0)