The complexity of surjective homomorphism problems-a survey

Authors:
Manuel Bodirsky;Jan Kára;Barnaby Martin
Affiliations:
CNRS/LIX, ícole Polytechnique, France;Institute for Theoretical Computer Science, Charles University, Prague, Czech Republic;Engineering and Computing Sciences, Durham University, UK
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 33
Cited 3

The complexity of colouring by semicomplete digraphs

SIAM Journal on Discrete Mathematics
On the algebraic structure of combinatorial problems

Theoretical Computer Science
List homomorphisms to reflexive graphs

Journal of Combinatorial Theory Series B
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Computational Complexity of Compaction to Reflexive Cycles

SIAM Journal on Computing
List Partitions

SIAM Journal on Discrete Mathematics
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Compaction, Retraction, and Constraint Satisfaction

SIAM Journal on Computing
Computational complexity of compaction to irreflexive cycles

Journal of Computer and System Sciences
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Journal of Computer and System Sciences
A dichotomy theorem for constraint satisfaction problems on a 3-element set

Journal of the ACM (JACM)
The Approximability of Three-valued MAX CSP

SIAM Journal on Computing
A complete complexity classification of the role assignment problem

Theoretical Computer Science - Graph colorings
The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Bi-arc graphs and the complexity of list homomorphisms

Journal of Graph Theory
Undirected connectivity in log-space

Journal of the ACM (JACM)
Covering graphs with few complete bipartite subgraphs

Theoretical Computer Science
Parameterizing Cut Sets in a Graph by the Number of Their Components

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Coloring mixed hypertrees

Discrete Applied Mathematics - Special issue: Efficient algorithms
The complexity of rooted phylogeny problems

Proceedings of the 13th International Conference on Database Theory
Computing role assignments of chordal graphs

Theoretical Computer Science
Retractions to Pseudoforests

SIAM Journal on Discrete Mathematics
Tractable cases of the extended global cardinality constraint

Constraints
The external constraint 4 nonempty part sandwich problem

Discrete Applied Mathematics
Complexity of conservative constraint satisfaction problems

ACM Transactions on Computational Logic (TOCL)
Computing vertex-surjective homomorphisms to partially reflexive trees

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Algorithms for partition of some class of graphs under compaction

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The computational complexity of disconnected cut and 2K2-partition

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
2K2-partition of some classes of graphs

Discrete Applied Mathematics
The P versus NP-complete dichotomy of some challenging problems in graph theory

Discrete Applied Mathematics

Computing vertex-surjective homomorphisms to partially reflexive trees

Theoretical Computer Science
Max-Sur-CSP on two elements

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Obtaining Online Ecological Colourings by Generalizing First-Fit

Theory of Computing Systems

Quantified Score

Hi-index	0.05

Visualization

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.