Searching for a Visible, Lazy Fugitive

DOI10.1137/090780006zbMath1294.05115OpenAlexW1964718398MaRDI QIDQ3094925

David Richerby, Dimitrios M. Thilikos

Publication date: 27 October 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8e4512836222a5c702f9c419dfb5a520b41c30c3

zbMATH Keywords

obstructionsgraph searchingpursuit evasion games

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Increasing the minimum degree of a graph by contractions ⋮ Edge degeneracy: algorithmic and structural results ⋮ On the Block Number of Graphs

This page was built for publication: Searching for a Visible, Lazy Fugitive