LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth

Authors:
Archontia C. Giannopoulou;Paul Hunter;Dimitrios M. Thilikos
Affiliations:
Department of Mathematics, National and Kapodistrian University of Athens, Greece;Department of Computer Science, University of Oxford, United Kingdom;Department of Mathematics, National and Kapodistrian University of Athens, Greece
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 19
Cited 0

Searching and pebbling

Theoretical Computer Science
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Ordered colourings

Discrete Mathematics
Rankings of Graphs

SIAM Journal on Discrete Mathematics
Directed tree-width

Journal of Combinatorial Theory Series B
On Vertex Ranking for Permutations and Other Graphs

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Theory of Elimination Trees for Sparse Unsymmetric Matrices

SIAM Journal on Matrix Analysis and Applications
DAG-width: connectivity measure for directed graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Linear time low tree-width partitions and algorithmic consequences

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tree-depth, subgraph coloring and homomorphism bounds

European Journal of Combinatorics
Directed tree-width examples

Journal of Combinatorial Theory Series B
Grad and classes with bounded expansion I. Decompositions

European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects

European Journal of Combinatorics
On Digraph Width Measures in Parameterized Algorithmics

Parameterized and Exact Computation
LIFO-search on digraphs: a searching game for cycle-rank

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
D-Width: a more natural measure for directed tree width

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.04

Visualization

Abstract

We introduce a variant of the classic node search game called LIFO-search where searchers are assigned different numbers. The additional rule is that a searcher can be removed only if no searchers of lower rank are in the graph at that moment. We show that all common variations of the game require the same number of searchers. We then introduce the notion of (directed) shelters in (di)graphs and prove a min-max theorem implying their equivalence to the cycle-rank/tree-depth parameter in (di)graphs. As (directed) shelters provide escape strategies for the fugitive, this implies that the LIFO-search game is monotone and that the LIFO-search parameter is equivalent to the one of cycle-rank/tree-depth in (di)graphs.