Digraph searching, directed vertex separation and directed pathwidth
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- scientific article; zbMATH DE number 1151792 (Why is no real title available?)
- Algorithms and obstructions for linear-width and related search parameters
- DAG-Width and Parity Games
- DAG-width
- Digraph Strong Searching: Monotonicity and Complexity
- Digraph measures: Kelly decompositions, games, and orderings
- Directed Searching Digraphs: Monotonicity and Complexity
- Directed one-trees
- Directed path-width and monotonicity in digraph searching
- Directed tree-width
- Directed tree-width examples
- Fugitive-search games on graphs and related parameters
- Graph searching and a min-max theorem for tree-width
- Graph searching and interval completion
- Graph searching, elimination trees, and a generalization of bandwidth
- Helicopter search problems, bandwidth and pathwidth
- Introducing directed tree width
- Mathematical Foundations of Computer Science 2005
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Searching and pebbling
- Searching and sweeping graphs: a brief survey
- The complexity of searching a graph
- The vertex separation and search number of a graph
- The vertex separation number of a graph equals its path-width
Cited in
(21)- Monotonicity in digraph search problems
- Characterizations and directed path-width of sequence digraphs
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Computing the zig-zag number of directed graphs
- Semi-dynamic breadth-first search in digraphs
- Sequentialization and procedural complexity in automata networks
- Standard directed search strategies and their applications
- On the Monotonicity of Weak Searching
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- How to compute digraph width measures on directed co-graphs
- On the pathwidth of almost semicomplete digraphs
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Directed Searching Digraphs: Monotonicity and Complexity
- A cops and robber game and the meeting time of synchronous directed walks
- Monotonicity of strong searching on digraphs
- Comparing linear width parameters for directed graphs
- Directed path-width and monotonicity in digraph searching
- Search and sweep numbers of finite directed acyclic graphs
- Computing directed pathwidth in \(O(1.89^n)\) time
- Computing the pathwidth of directed graphs with small vertex cover
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
This page was built for publication: Digraph searching, directed vertex separation and directed pathwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944735)
