Feedback arc set in bipartite tournaments is NP-complete (Q845963): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:29, 30 January 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
