Digraph decompositions and monotonicity in digraph searching
DOI10.1016/J.TCS.2011.05.003zbMATH Open1223.68085OpenAlexW2036443333MaRDI QIDQ638540FDOQ638540
Authors: Stephan Kreutzer, Sebastian Ordyniak 
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.003
Recommendations
monotonicityentanglementcops and robber gamesgraph searchingDAG-widthKelly-widthdirected path-widthdirected tree-width
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Graph searching and a min-max theorem for tree-width
- A partial k-arboretum of graphs with bounded treewidth
- Directed tree-width
- Directed path-width and monotonicity in digraph searching
- Introducing directed tree width
- Are there any good digraph width measures?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
- Logic for Programming, Artificial Intelligence, and Reasoning
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- Recontamination does not help to search a graph
- Sweeping graphs with large clique number
- Fugitive-search games on graphs and related parameters
- On the monotonicity of games generated by symmetric submodular functions.
- Monotonicity in graph searching
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph Strong Searching: Monotonicity and Complexity
- Monotonicity of non-deterministic graph searching
- DAG-Width and Parity Games
- DAG-width
- Searching and sweeping graphs: a brief survey
- On digraph width measures in parameterized algorithmics
- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
- Graph searching games
- Searching for a Visible, Lazy Fugitive
Cited In (9)
- What’s Next? Future Directions in Parameterized Complexity
- Adapting the Directed Grid Theorem into an FPT Algorithm
- Digraphs of Bounded Width
- Digraph Decompositions and Monotonicity in Digraph Searching
- Monotonicity of strong searching on digraphs
- Digraph Strong Searching: Monotonicity and Complexity
- The treewidth of proofs
- Digraph width measures in parameterized algorithmics
- Directed elimination games
This page was built for publication: Digraph decompositions and monotonicity in digraph searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638540)
