Pages that link to "Item:Q2957884"
From MaRDI portal
The following pages link to Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings (Q2957884):
Displaying 6 items.
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (Q4554366) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)