Pages that link to "Item:Q3104788"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788):
Displaying 11 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- Directed Pathwidth and Palletizers (Q3467832) (← links)
