The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Steéphan Thomassé / rank | |||
| Property / author | |||
| Property / author: Steéphan Thomassé / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548306007887 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082806890 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:26, 30 July 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
