The complexity of surjective homomorphism problems - A survey

53Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of whose complexity remains open. © 2012 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bodirsky, M., Kára, J., & Martin, B. (2012). The complexity of surjective homomorphism problems - A survey. Discrete Applied Mathematics, 160(12), 1680–1690. https://doi.org/10.1016/j.dam.2012.03.029

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free