Jumping robbers in digraphs

DOI10.1016/j.tcs.2016.09.016zbMath1353.05087OpenAlexW2525360203MaRDI QIDQ343927

Roman Rabinovich, Bernd Puchala

Publication date: 29 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.016

zbMATH Keywords

monotonicitygraph searching gamesmultiple robbers

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dag-width of directed graphs
• Monotonicity of non-deterministic graph searching
• Digraph measures: Kelly decompositions, games, and orderings
• An annotated bibliography on guaranteed graph searching
• Monotony properties of connected visible graph searching
• Nondeterministic graph searching: from pathwidth to treewidth
• Interval graphs and searching
• A partial k-arboretum of graphs with bounded treewidth
• Graph searching and a min-max theorem for tree-width
• Searching and pebbling
• Directed tree-width
• Directed path-width and monotonicity in digraph searching
• DAG-width
• Monotonicity in graph searching
• From Pathwidth to Connected Pathwidth
• Graph Searching in a Crime Wave
• DAG-Width and Parity Games
• Distance d-Domination Games
• Computer Aided Verification

This page was built for publication: Jumping robbers in digraphs