Abstract
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulated in terms of spanning subgraphs and subgraphs, and as such their computational complexity has been extensively studied. What about the surjective variant? Because this problem is NP-complete in general, we restrict the guest and the host graph to belong to graph classes \({\cal G}\) and \({\cal H}\), respectively. We determine to what extent a certain choice of \({\cal G}\) and \({\cal H}\) influences its computational complexity. We observe that the problem is polynomial-time solvable if \({\cal H}\) is the class of paths, whereas it is NP-complete if \({\cal G}\) is the class of paths. Moreover, we show that the problem is even NP-complete on many other elementary graph classes, namely linear forests, unions of complete graphs, cographs, proper interval graphs, split graphs and trees of pathwidth at most 2. In contrast, we prove that the problem is fixed-parameter tractable in k if \({\cal G}\) is the class of trees and \({\cal H}\) is the class of trees with at most k leaves, or if \({\cal G}\) and \({\cal H}\) are equal to the class of graphs with vertex cover number at most k.
Keywords
- Complete Graph
- Vertex Cover
- Hamiltonian Path
- Tree Decomposition
- Graph Class
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The work was supported by EPSRC (EP/G043434/1 and EP/G020604/1) and the Royal Society (JP090172). The 2nd author was supported by Charles University as GAUK 95710.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adiga, A., Chitnis, R., Saurabh, S.: Parameterized Algorithms for Boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 366–377. Springer, Heidelberg (2010)
Bodirsky, M., Kára, J., Martin, B.: The complexity of surjective homomorphism problems – a survey (manuscript), ArXiv, http://arxiv.org/abs/1104.5257
Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310–326. Springer, Heidelberg (2002)
Enciso, R., Fellows, M.R., Guo, J., Kanj, I., Rosamond, F., Suchý, O.: What Makes Equitable Connected Partition Easy. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 122–133. Springer, Heidelberg (2009)
Feder, T., Hell, P., Jonsson, P., Krokhin, A., Nordh, G.: Retractions to pseudoforests. SIAM Journal on Discrete Mathematics 24, 101–112 (2010)
Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph Layout Problems Parameterized by Vertex Cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294–305. Springer, Heidelberg (2008)
Fiala, J., Kratochvíl, J.: Locally constrained graph homomorphisms – structure, complexity, and applications. Computer Science Review 2, 97–111 (2008)
Fiala, J., Golovach, P.A., Kratochvíl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comp. Sci. 412, 2513–2523 (2011)
Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theor. Comp. Sci. 349, 67–81 (2005)
Flum, J., Grohe, M.: Parameterized complexity theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
Frank, A., Tardos, É.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7, 49–65 (1987)
Golovach, P.A., Paulusma, D., Song, J.: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 261–274. Springer, Heidelberg (2011)
Garey, M.R., Johnson, D.R.: Computers and intractability. Freeman, NY (1979)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54 (2007)
Hell, P., Nešetřil, J.: On the complexity of H-colouring. Journal of Combinatorial Theory, Series B 48, 92–110 (1990)
Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford University Pr. (2004)
Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983)
Martin, B., Paulusma, D.: The Computational Complexity of Disconnected Cut and 2K 2-Partition. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 561–575. Springer, Heidelberg (2011)
Vikas, N.: Computational complexity of compaction to reflexive cycles. SIAM Journal on Computing 32, 253–280 (2002)
Vikas, N.: Compaction, retraction, and constraint satisfaction. SIAM Journal on Computing 33, 761–782 (2004)
Vikas, N.: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. J. Comput. Syst. Sci. 71, 406–439 (2005)
Vikas, N.: Algorithms for Partition of Some Class of Graphs under Compaction. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 319–330. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golovach, P.A., Lidický, B., Martin, B., Paulusma, D. (2012). Finding Vertex-Surjective Graph Homomorphisms. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-30642-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30641-9
Online ISBN: 978-3-642-30642-6
eBook Packages: Computer ScienceComputer Science (R0)
