Pages that link to "Item:Q5111401"
From MaRDI portal
The following pages link to Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs (Q5111401):
Displaying 4 items.
- An iterative procedure for evaluating digraph competitions (Q1614130) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← 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)