Pages that link to "Item:Q944735"
From MaRDI portal
The following pages link to Digraph searching, directed vertex separation and directed pathwidth (Q944735):
Displaying 6 items.
- 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)
- Monotonicity in digraph search problems (Q955030) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
