Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"homomorphism problem"”.
-
Width functions for hypertree decompositions
… or an instance of a constraint satisfaction problem) it also gives rise to important algorithmic results: Many problems that are NP-complete in general become polynomially tractable when restricted to instances of bounded tree-width. By a result of Grohe, tree-width is the best graph …