Pages that link to "Item:Q2312615"
From MaRDI portal
The following pages link to On width measures and topological problems on semi-complete digraphs (Q2312615):
Displaying 7 items.
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341) (← links)
- Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings (Q2957884) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (Q4554366) (← links)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments (Q6045407) (← links)