Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419412 | Discrete Applied Mathematics | 2012 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Manuel Bodirsky, Jan Kára, Barnaby Martin,