The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737)

From MaRDI portal
Revision as of 10:10, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q858107)
scientific article
Language Label Description Also known as
English
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
scientific article

    Statements

    title
    The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (English)
    0 references
    author
    Pierre Charbit
    0 references
    Anders Yeo
    0 references
    publication date
    20 March 2007
    0 references
    zbMATH DE Number
    5135104
    0 references
    zbMATH Keywords
    tournaments
    0 references
    feedback arc set
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3429737&oldid=22164060"
    Powered by MediaWiki