The Complexity of the List Homomorphism Problem for Graphs

Theory of Computing Systems 2012 / 08 Vol. 51; Iss. 2

The Complexity of the List Homomorphism Problem for Graphs

László Egri, Andrei Krokhin, Benoit Larose, Pascal Tesson
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:
51
Language:
english
Pages:
36
DOI:
10.1007/s00224-011-9333-8
Date:
August, 2012
File:
PDF, 1.06 MB
english, 2012
Conversion to is in progress
Conversion to is failed