Feedback arc set in bipartite tournaments is NP-complete (Q845963)

From MaRDI portal
Revision as of 08:27, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    feedback set problems
    0 references
    bipartite tournaments
    0 references