![Graph operations / Tree decomposition / Decomposition method / Path decomposition / Parameterized complexity / Constraint satisfaction problem / Bipartite graph / Hypertree / Hypergraph / Graph theory / Theoretical computer science / Constraint programming Graph operations / Tree decomposition / Decomposition method / Path decomposition / Parameterized complexity / Constraint satisfaction problem / Bipartite graph / Hypertree / Hypergraph / Graph theory / Theoretical computer science / Constraint programming](https://www.pdfsearch.io/img/55b1f3f222425b4270af2af4bd542bac.jpg) Date: 2013-06-06 21:34:11Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming | | Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenij Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man InAdd to Reading ListSource URL: www.cs.ox.ac.ukDownload Document from Source Website File Size: 633,04 KBShare Document on Facebook
|