Search for Author All Reviews
	Egri, Laszlo     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       The complexity of the list homomorphism problem for graphs Egri L., Krokhin A., Larose B., Tesson P. Theory of Computing Systems 51(2): 143-178, 2012.  Type: Article Homomorphisms are very useful in combinatorial problems in mapping and assignments. Homomorphism problems involve greater modeling power than graph coloring, yet compared to general constraint satisfaction problems (CSPs), they are sim...... May 8 2013
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy