Pages that link to "Item:Q3429737"
From MaRDI portal
The following pages link to The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737):
Displayed 4 items.
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)