LIFO-search on digraphs: a searching game for cycle-rank

Authors:
Paul Hunter
Affiliations:
Department of Computer Science, University of Oxford
Venue:
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Year:
2011

Citing 13
Cited 1

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
Directed tree-width

Journal of Combinatorial Theory Series B
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
Tree-depth, subgraph coloring and homomorphism bounds

European Journal of Combinatorics
Directed tree-width examples

Journal of Combinatorial Theory Series B
Digraph Decompositions and Monotonicity in Digraph Searching

Graph-Theoretic Concepts in Computer Science
On Digraph Width Measures in Parameterized Algorithmics

Parameterized and Exact Computation
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

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

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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 cyclerank of the digraph. We also obtain a tight duality theorem, giving a precise min-max characterization of obstructions for cycle-rank.