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

  • Paul Hunter
Conference paper

DOI: 10.1007/978-3-642-22953-4_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6914)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Paul Hunter
    • 1
  1. 1.Department of Computer ScienceUniversity of OxfordUK

Personalised recommendations