Monotonicity in digraph search problems
DOI10.1016/j.tcs.2008.08.025zbMath1153.68041OpenAlexW2074771880MaRDI QIDQ955030
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.025
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An annotated bibliography on guaranteed graph searching
- Digraph searching, directed vertex separation and directed pathwidth
- On a pursuit game on Cayley digraphs
- Search and sweep numbers of finite directed acyclic graphs
- On the monotonicity of games generated by symmetric submodular functions.
- Searching and pebbling
- Directed tree-width
- Monotonicity of strong searching on digraphs
- Directed path-width and monotonicity in digraph searching
- On the Monotonicity of Weak Searching
- Arc Searching Digraphs Without Jumping
- The complexity of searching a graph
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Mathematical Foundations of Computer Science 2005
- Depth-First Search and Linear Graph Algorithms
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Monotonicity in digraph search problems
