Jumping robbers in digraphs
From MaRDI portal
Publication:343927
DOI10.1016/j.tcs.2016.09.016zbMath1353.05087MaRDI 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
91A43: Games involving graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
91A24: Positional games (pursuit and evasion, etc.)
05C57: Games on graphs (graph-theoretic aspects)
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