LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
From MaRDI portal
Publication:713301
DOI10.1016/j.dam.2012.03.015zbMath1250.91019OpenAlexW2067942639MaRDI QIDQ713301
Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos
Publication date: 26 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.015
Related Items (7)
List rankings and on-line list rankings of graphs ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ On low tree-depth decompositions ⋮ Edge and pair queries-random graphs and complexity ⋮ Unnamed Item ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth
Cites Work
- Unnamed Item
- Unnamed Item
- Graph searching and a min-max theorem for tree-width
- Fugitive-search games on graphs and related parameters
- Searching and pebbling
- Directed tree-width
- Optimal edge ranking of trees in polynomial time
- Ordered colourings
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- 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
- Linear time low tree-width partitions and algorithmic consequences
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank
- DAG-width
- On Digraph Width Measures in Parameterized Algorithmics
- Monotonicity in graph searching
- Rankings of Graphs
- 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: a min-max theorem and a searching game for cycle-rank and tree-depth
