Pages that link to "Item:Q944735"
From MaRDI portal
The following pages link to Digraph searching, directed vertex separation and directed pathwidth (Q944735):
Displaying 15 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)
- Sequentialization and procedural complexity in automata networks (Q2055976) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms (Q2284641) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← 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)
