Feedback arc set in bipartite tournaments is NP-complete (Q845963)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5664779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feedback arc set in bipartite tournaments is NP-complete |
scientific article; zbMATH DE number 5664779 |
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
0.94952476
0 references
0.94952476
0 references
0.92226446
0 references
0 references
0 references
0.88538784
0 references
0.8835539
0 references
0.8835539
0 references
0.8813479
0 references
