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

DOI10.1007/978-3-642-22953-4_19zbMath1342.05088arXiv1103.6019OpenAlexW1498089176MaRDI QIDQ3088285

Paul Hunter

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.6019

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

On low tree-depth decompositions ⋮ LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth

Cites Work

• Graph searching and a min-max theorem for tree-width
• Fugitive-search games on graphs and related parameters
• Searching and pebbling
• Directed tree-width
• Tree-depth, subgraph coloring and homomorphism bounds
• Directed path-width and monotonicity in digraph searching
• Transition graphs and the star-height of regular events
• Directed tree-width examples
• DAG-width
• On Digraph Width Measures in Parameterized Algorithmics
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Digraph Decompositions and Monotonicity in Digraph Searching
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• DAG-Width and Parity Games
• Mathematical Foundations of Computer Science 2005

This page was built for publication: LIFO-Search on Digraphs: A Searching Game for Cycle-Rank