64 search results - page 3 / 13 » The Complexity of the List Homomorphism Problem for Graphs |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
LICS
2000
IEEE
13 years 10 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
COCOA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
AAIM
2008
Springer
14 years 3 days ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
EJC
2008
13 years 5 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...