Minimum Cost Homomorphism Dichotomy for Oriented Cycles.

Graphs and Combinatorics (Impact Factor: 0.33). 11/2009; 25:521-531. DOI: 10.1007/s00373-009-0853-9
Source: DBLP

ABSTRACT 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 costs c

(u),i ∈ V(H), then the cost of the homomorphism f is ∑
u ∈V(D)

f(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for
H (abbreviated MinHOM(H)). The problem is to decide, for an input graph D with costs c

(u),u ∈ V(D),i ∈ V(H), whether there exists a homomorphism of D to H and, if one exists, to find one of minimum cost. We obtain a dichotomy classification for the time complexity of MinHOM(H) when H is an oriented cycle. We conjecture a dichotomy classification for all digraphs with possible loops.

Download full-text


Available from: Arash Rafiey, Jun 30, 2015
  • [Show abstract] [Hide abstract]
    ABSTRACT: We introduce a class of digraphs analogous to proper interval graphs and bigraphs. They are defined via a geometric representation by two inclusion-free families of intervals satisfying a certain monotonicity condition; hence we call them monotone proper interval digraphs. They admit a number of equivalent definitions, including an ordering characterization by so-called Min-Max orderings, and the existence of certain graph polymorphisms. Min-Max orderings arose in the study of minimum cost homomorphism problems: if $H$ admits a a Min-Max ordering (or a certain extension of Min-Max orderings), then the minimum cost homomorphism problem to $H$ is known to admit a polynomial time algorithm. We give a forbidden structure characterization of monotone proper interval digraphs, which implies a polynomial time recognition algorithm. This characterizes digraphs with a Min-Max ordering; we also similarly characterize digraphs with an extended Min-Max ordering. In a companion paper, we shall apply this latter characterization to derive a conjectured dichotomy classification for the minimum cost homomorphism problems---namely, we shall prove that the minimum cost homomorphism problem to a digraph that does not admit an extended Min-Max ordering is NP-complete.
    SIAM Journal on Discrete Mathematics 01/2012; 26(4):1576-1596. DOI:10.1137/100783844 · 0.58 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The minimum cost homomorphism problem has arisen as a natural and useful optimization problem in the study of graph (and digraph) coloring and homomorphisms: it unifies a number of other well studied optimization problems. It was shown by Gutin, Rafiey, and Yeo that the minimum cost problem for homomorphisms to a digraph $H$ that admits a so-called extended Min-Max ordering is polynomial time solvable, and these authors conjectured that for all other digraphs $H$ the problem is NP-complete. In a companion paper, we gave a forbidden structure characterization of digraphs that admit extended Min-Max orderings. In this paper, we apply this characterization to prove Gutin's conjecture.
    SIAM Journal on Discrete Mathematics 01/2012; 26(4):1597–1608. DOI:10.1137/100783856 · 0.58 Impact Factor