Can I read A Dichotomy for Minimum Cost Graph Homomorphisms on EtoBox?

A Dichotomy for Minimum Cost Graph Homomorphisms by Gregory Gutin; Pavol Hell; Arash Rafiey; Anders Yeo is a Mathematics article available to read on EtoBox.

What is A Dichotomy for Minimum Cost Graph Homomorphisms about?

For graphs G and H , a mapping f : For each fixed graph H , we have the minimum cost homomorphism problem, written as MinHOM(H ). The problem is to decide, for an input graph G with costs c i (u), u ∈ V (G), i ∈ V (H ), whether there exists a homomorphism of G to H and, if one exists, to find one of minimum cost. Minimum cost homomorphism problems encompass (or are related to) many well-studied optimization problems. We prove a dichotomy of the minimum cost homomorphism problems for graphs H , with loops allowed. When each connected component of H is either a reflexive proper interval graph or an irreflexive proper interval bigraph, the problem MinHOM(H ) is polynomial time solvable. In all other cases the problem MinHOM(H ) is NP-hard.

Who reads A Dichotomy for Minimum Cost Graph Homomorphisms?

Author

Gregory Gutin; Pavol Hell; Arash Rafiey; Anders Yeo

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0195-6698)

Published

2008

Language

EN

Field

Mathematics (Physical Sciences)