Feedback arc set in bipartite tournaments is NP-complete (Q845963): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141319521 / rank | |||
Normal rank | |||
Revision as of 01:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feedback arc set in bipartite tournaments is NP-complete |
scientific article |
Statements
Feedback arc set in bipartite tournaments is NP-complete (English)
0 references
29 January 2010
0 references
combinatorial problems
0 references
computational complexity
0 references
feedback set problems
0 references
bipartite tournaments
0 references
