Computing Directed Pathwidth in O(1.89 n ) Time
From MaRDI portal
Recommendations
- Computing directed pathwidth in O(1.89ⁿ) time
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Computing Pathwidth Faster Than 2 n
- Computing the pathwidth of directed graphs with small vertex cover
- Directed path-width and monotonicity in digraph searching
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph
- Automata, Languages and Programming
- Solving shortest paths efficiently on nearly acyclic directed graphs
Cited in
(14)- On the complexity of the FIFO stack-up problem
- Computing Pathwidth Faster Than 2 n
- Computing directed pathwidth in O(1.89ⁿ) time
- Characterizations and directed path-width of sequence digraphs
- Finding small-width connected path decompositions in polynomial time
- Directed path-width of sequence digraphs
- Directed path-width and directed tree-width of directed co-graphs
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Computing the pathwidth of directed graphs with small vertex cover
- Treewidth and pathwidth parameterized by the vertex cover number
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Computing tree-depth faster than \(2^n\)
- Directed pathwidth and palletizers
This page was built for publication: Computing Directed Pathwidth in O(1.89 n ) Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899252)
