The complexity of the minimum cost homomorphism problem for...

Discrete Applied Mathematics 2010 Vol. 158; Iss. 4

The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops

Gregory Gutin, Eun Jung Kim
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
158
Year:
2010
Language:
english
Pages:
12
DOI:
10.1016/j.dam.2009.07.013
File:
PDF, 743 KB
english, 2010
Conversion to is in progress
Conversion to is failed