The complexity of digraph homomorphisms: Local tournaments, injective homomorphisms and polymorphisms
In this thesis we examine the computational complexity of certain digraph homomorphism problems. A homomorphism between digraphs, denoted by $f: G \to H$, is a mapping from the vertices of $G$ to the vertices of $H$ such that the arcs of $G$ are preserved. The problem of deciding whether a homomorph...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/1304 |