Nondeterministic Graph Searching: From Pathwidth to Treewidth
We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game- theoretic approach and graph decompositions called q-branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard) tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q ≥ 0, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required to search a graph with the minimum number of searchers.
Keywordstreewidth pathwidth graph searching
Unable to display preview. Download preview PDF.
- 1.Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI-2001), pp. 7–15. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
- 8.Feige, U., Hajiaghayi, M., Lee, J.: Improved approximation algorithms for minimum-weight vertex separators. In: 37th ACM Symposium on Theory of Computing, STOC 2005 (2005)Google Scholar
- 9.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)Google Scholar
- 11.Goldsmith, J., Levy, M., Munhenk, M.: Limited Nondeterminism. SIGACT News, Introduction to Complexity Theory Column 13 (June 1996)Google Scholar