Monotonicity of non-deterministic graph searching
DOI10.1016/J.TCS.2008.02.036zbMATH Open1146.68060OpenAlexW2034927865MaRDI QIDQ930888FDOQ930888
Authors: Frédéric Mazoit, Nicolas Nisse 
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.036
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Searching and pebbling
- Directed tree-width
- Directed path-width and monotonicity in digraph searching
- Complexity of Finding Embeddings in a k-Tree
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- The vertex separation and search number of a graph
- Fugitive-search games on graphs and related parameters
- Monotony Properties of Connected Visible Graph Searching
- Monotonicity in graph searching
- DAG-Width and Parity Games
- DAG-width
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
Cited In (13)
- Non-deterministic graph searching in trees
- Edge Search Number of Cographs in Linear Time
- Edge search number of cographs
- Maximum vertex occupation time and inert fugitive: Recontamination does help
- The mixed search game against an agile and visible fugitive is monotone
- On the monotonicity of process number
- Digraph Decompositions and Monotonicity in Digraph Searching
- Monotonicity of strong searching on digraphs
- Monotonicity of Non-deterministic Graph Searching
- Digraph Strong Searching: Monotonicity and Complexity
- Jumping robbers in digraphs
- Digraph decompositions and monotonicity in digraph searching
- Nondeterministic graph searching: from pathwidth to treewidth
This page was built for publication: Monotonicity of non-deterministic graph searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930888)
