LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
type: Item
instance of: scholarly article
title: LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
zbMATH Open document ID: 1250.91019
author: Archontia C. Giannopoulou
author: Paul Hunter
author: Dimitrios M. Thilikos
published in: Discrete Applied Mathematics
publication date: 2012-10-26T00:00:00Z
Mathematics Subject Classification ID: 91A22
Mathematics Subject Classification ID: 05C57
zbMATH DE Number: 6099336
zbMATH Keywords: graph parameters
zbMATH Keywords: graph searching
zbMATH Keywords: pursuit-evasion games
zbMATH Keywords: cycle-rank
zbMATH Keywords: tree-depth
zbMATH Keywords: obstructions
zbMATH Keywords: min-max theorem
MaRDI profile type: Publication
full work available at URL: j.dam.2012.03.015
OpenAlex ID: W2067942639
cites work: Directed tree-width examples
cites work: Directed path-width and monotonicity in digraph searching
cites work: DAG-Width and Parity Games
cites work: Monotonicity in graph searching
cites work: Rankings of Graphs
cites work: Optimal edge ranking of trees in polynomial time
cites work: Fugitive-search games on graphs and related parameters
cites work: Q4942652
cites work: Transition graphs and the star-height of regular events
cites work: The Theory of Elimination Trees for Sparse Unsymmetric Matrices
cites work: On Digraph Width Measures in Parameterized Algorithmics
cites work: A min-max theorem for LIFO-search
cites work: LIFO-Search on Digraphs: A Searching Game for Cycle-Rank
cites work: Directed tree-width
cites work: Ordered colourings
cites work: Searching and pebbling
cites work: Digraph Decompositions and Monotonicity in Digraph Searching
cites work: Recontamination does not help to search a graph
cites work: Grad and classes with bounded expansion. II: Algorithmic aspects
cites work: Linear time low tree-width partitions and algorithmic consequences
cites work: Tree-depth, subgraph coloring and homomorphism bounds
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: DAG-width
cites work: Mathematical Foundations of Computer Science 2005
cites work: Graph searching and a min-max theorem for tree-width
DOI: 10.1016/J.DAM.2012.03.015
description: scientific article; zbMATH DE number 6099336