Pages that link to "Item:Q4899252"
From MaRDI portal
The following pages link to Computing Directed Pathwidth in O(1.89 n ) Time (Q4899252):
Displaying 13 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Directed path-width and directed tree-width of directed co-graphs (Q1790979) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Directed Pathwidth and Palletizers (Q3467832) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
