Skip to main content
SpringerLink
Log in

Nondeterministic Graph Searching: From Pathwidth to Treewidth

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amini, O., Huc, F., Perennes, S.: On the pathwidth of planar Graphs. SIAM J. Discret. Math. (to appear)

  2. Amir, E.: Efficient approximation for triangulation of minimum treewidth, In: Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI-2001), San Francisco, CA, pp. 7–15. Morgan Kaufmann (2001)

  3. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discret. Methods 8, 277–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discret. Math. Theor. Comput. Sci. 5, 33–49 (1991)

    MathSciNet  Google Scholar 

  5. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Coudert, D., Huc, F., Sereni, J.-S.: Pathwidth of outerplanar graphs. J. Graph Theory 55(1), 27–41 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. Theor. Comput. Sci. 172, 233–254 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)

    Google Scholar 

  9. Ellis, J.A., Sudborough, I.H., Turner, J.: The vertex separation and search number of a graph. Inf. Comput. 113, 50–79 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Feige, U., Hajiaghayi, M., Lee, J.: Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005), pp. 563–572. ACM, New York (2005)

    Chapter  Google Scholar 

  11. Fomin, F.V., Thilikos, D.M.: On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory 55(1), 42–54 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fomin, F.V., Kratsch, D., Todinca, I.: Exact algorithms for treewidth and minimum fill-in. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Computer Science, vol. 3142, pp. 568–580. Springer, Berlin (2004)

    Google Scholar 

  13. Goldsmith, J., Levy, M., Munhenk, M.: Limited Nondeterminism. SIGACT News, Introduction to Complexity Theory, Column 13, June 1996

  14. Held, M., Karp, R.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10, 196–210 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theor. Comput. Sci. 47, 205–218 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  16. Makedon, F.S., Papadimitriou, C.H., Sudborough, I.H.: Topological bandwidth. SIAM J. Algebr. Discret. Methods 6, 418–444 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  17. Makedon, F.S., Sudborough, I.H.: On minimizing width in linear layouts. Discret. Appl. Math. 23, 243–265 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Mazoit, F., Nisse, N.: Monotonicity property of non-deterministic graph searching. In: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007) (to appear)

  19. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52, 153–190 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  20. Seymour, P., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Ser. B 58, 22–33 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  21. Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14, 217–241 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6, 537–546 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  23. Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization: “Eureka, you shrink”. Lecture Notes in Computer Science, vol. 2570, pp. 185–207. Springer, Berlin (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, P.O. Box 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  2. CNRS, Lab. de Recherche en Informatique, Université Paris-Sud, 91405, Orsay, France

    Pierre Fraigniaud

  3. Lab. de Recherche en Informatique, Université Paris-Sud, 91405, Orsay, France

    Nicolas Nisse

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Nisse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Nisse.

Additional information

Additional support of F.V. Fomin by the Research Council of Norway.

Additional supports of P. Fraigniaud from the INRIA Project “Grand Large”, and from the Project PairAPair of the ACI “Masse de Données”.

Additional supports of N. Nisse from the Project Fragile of the ACI “Sécurité & Informatique”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fomin, F.V., Fraigniaud, P. & Nisse, N. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53, 358–373 (2009). https://doi.org/10.1007/s00453-007-9041-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9041-6

Keywords

Search

Navigation