Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2011: Fundamentals of Computation Theory pp 217–228Cite as

LIFO-Search on Digraphs: A Searching Game for Cycle-Rank

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6914))

Abstract

We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same number of searchers, and the minimal number of searchers required is one more than the cycle-rank of the digraph. We also obtain a tight duality theorem, giving a precise min-max characterization of obstructions for cycle-rank.

This work resulted from discussions during Dagstuhl Seminar 11071 on Graph Searching, Theory and Applications.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adler, I.: Directed tree-width examples. Journal of Combinatorial Theory, Series B 97(5), 718–725 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barát, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22(2), 161–172 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-width and parity games. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science, pp. 524–536 (2006)

    Google Scholar 

  4. Bienstock, D., Seymour, P.D.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. Theoretical Computer Science 172(1-2), 233–254 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Mathematical Journal 10(4), 385–397 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eisenstat, S., Liu, J.: The theory of elimination trees for sparse unsymmetric matrices. SIAM Journal of Matrix Analysis & Applications 26(3), 686–705 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., Rossmanith, P.: On digraph width measures in parameterized algorithmics. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 185–197. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Giannapolou, A., Thilikos, D.: A min-max theorem for LIFO-search. Presented at the 4th Workshop on Graph Searching, Theory and Applications, GRASTA 2011 (2011)

    Google Scholar 

  10. Gruber, H.: Digraph Complexity Measures and Applications in Formal Language Theory. In: 4th Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008), pp. 60–67 (2008)

    Google Scholar 

  11. Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. Journal of Combinatorial Theory (Series B) 82(1), 138–154 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kirousis, L., Papadimitriou, C.: Searching and pebbling. Theoretical Computer Science 47(3), 205–218 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kreutzer, S., Ordyniak, S.: Digraph decompositions and monotonicity in digraph searching. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 336–347. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. LaPaugh, A.S.: Recontamination does not help to search a graph. Journal of the ACM 40(2), 224–245 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics 27(6), 1022–1041 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Obdržálek, J.: DAG-width: Connectivity measure for directed graphs. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 814–821 (2006)

    Google Scholar 

  17. Safari, M.A.: D-width: A more natural measure for directed tree width. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, pp. 745–756 (2005)

    Google Scholar 

  18. Seymour, P.D., Thomas, R.: Graph searching, and a min-max theorem for tree-width. Journal of Combinatorial Theory (Series B) 58, 22–33 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oxford, UK

    Paul Hunter

Authors
  1. Paul Hunter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Oslo, Postboks 1080 Blindern, 0316, Oslo, Norway

    Olaf Owe  & Martin Steffen  & 

  2. Department of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Jan Arne Telle

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hunter, P. (2011). LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. In: Owe, O., Steffen, M., Telle, J.A. (eds) Fundamentals of Computation Theory. FCT 2011. Lecture Notes in Computer Science, vol 6914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22953-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22953-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22952-7

  • Online ISBN: 978-3-642-22953-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation