The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q858107 |
Changed an Item |
||
| Property / author | |||
| Property / author: Steéphan Thomassé / rank | |||
Normal rank | |||
Revision as of 10:10, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments |
scientific article |
Statements
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (English)
0 references
20 March 2007
0 references
tournaments
0 references
feedback arc set
0 references
