Pages that link to "Item:Q300464"
From MaRDI portal
The following pages link to Computing directed pathwidth in \(O(1.89^n)\) time (Q300464):
Displaying 9 items.
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Directed path-width and directed tree-width of directed co-graphs (Q1790979) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- Computing Directed Pathwidth in O(1.89 n ) Time (Q4899252) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)