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

DOI10.1016/J.DAM.2012.03.015zbMATH Open1250.91019OpenAlexW2067942639MaRDI QIDQ713301FDOQ713301

Authors: 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

Recommendations

• A min-max theorem for LIFO-search
• LIFO-search on digraphs: a searching game for cycle-rank
• Fugitive-search games on graphs and related parameters
• scientific article; zbMATH DE number 176249
• Monotonicity and inert fugitive search games

zbMATH Keywords

tree-depthobstructionsgraph parametersgraph searchingpursuit-evasion gamesmin-max theoremcycle-rank

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Evolutionary games (91A22)

Cites Work

• Graph searching and a min-max theorem for tree-width
• Searching and pebbling
• Directed tree-width
• 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
• Rankings of Graphs
• Mathematical Foundations of Computer Science 2005
• Recontamination does not help to search a graph
• Fugitive-search games on graphs and related parameters
• Ordered colourings
• Directed tree-width examples
• Monotonicity in graph searching
• Title not available (Why is that?)
• Digraph Decompositions and Monotonicity in Digraph Searching
• Optimal edge ranking of trees in polynomial time
• Transition graphs and the star-height of regular events
• Linear time low tree-width partitions and algorithmic consequences
• DAG-Width and Parity Games
• DAG-width
• On digraph width measures in parameterized algorithmics
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• A min-max theorem for LIFO-search
• LIFO-search on digraphs: a searching game for cycle-rank

Cited In (9)

• List rankings and on-line list rankings of graphs
• A graph searching game for block treedepth and a cubic kernel by vertex cover
• LIFO-search on digraphs: a searching game for cycle-rank
• Edge and pair queries-random graphs and complexity
• Title not available (Why is that?)
• On low tree-depth decompositions
• Compact representation of graphs with bounded bandwidth or treedepth
• The complexity of bicriteria tree-depth
• The complexity of bicriteria tree-depth

This page was built for publication: LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713301)