Title of article
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops Original Research Article
Author/Authors
Gregory Gutin، نويسنده , , Eun Jung Kim، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
12
From page
319
To page
330
Keywords
Homomorphisms , Dichotomy , Semicomplete digraphs , Minimum cost homomorphisms
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887343
Link To Document