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

From MaRDI portal
Revision as of 01:55, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references