LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth☆
Under an Elsevier user license
open archive
Keywords
Graph parameters
Graph searching
Pursuit–evasion games
Cycle-rank
Tree-depth
Obstructions
Min–max theorem
Cited by (0)
- ☆
Part of this research was presented during Dagstuhl Seminar 11071 (13.02.11–18.02.11) on Theory and Applications of Graph Searching Problems (Fomin et al., 2011) [11]. Preliminary versions of this paper appeared in EUROCOMB 2011 (Giannopoulou and Thilikos, 2011) [13] and in FCT 2011 (Hunter, 2011) [15].
Copyright © 2012 Elsevier B.V. All rights reserved.