Nondeterministic Graph Searching: From Pathwidth to Treewidth

  title={Nondeterministic Graph Searching: From Pathwidth to Treewidth},
  author={Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse},
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… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 26 references


U. Feige, M. Hajiaghayi
Lee . Improved approximation algorithms for minimum-weight vertex separators. In 37th ACM Symposium on Theory of Computing • 2005

On treewidth approximations

Discrete Applied Mathematics • 2004
View 1 Excerpt

Exact Algorithms for NP-Hard Problems: A Survey

Combinatorial Optimization • 2001
View 1 Excerpt

Parameterized Complexity

Monographs in Computer Science • 1999
View 1 Excerpt

Similar Papers

Loading similar papers…