Computing the minimal covering set (Q943589)

From MaRDI portal
Revision as of 16:42, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the minimal covering set
scientific article

    Statements

    title
    Computing the minimal covering set (English)
    0 references
    author
    Felix Brandt
    0 references
    Felix Fischer
    0 references
    publication date
    10 September 2008
    0 references
    Mathematics Subject Classification ID
    91D10
    0 references
    90C05
    0 references
    91-04
    0 references
    zbMATH DE Number
    5323869
    0 references
    zbMATH Keywords
    social choice theory
    0 references
    minimal covering set
    0 references
    essential set
    0 references
    uncovered set
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W2098386424
    0 references
    cites work
    Ranking Tournaments
    0 references
    Q5808751
    0 references
    Q3254699
    0 references
    Q4843270
    0 references
    Q4197641
    0 references
    Q3252269
    0 references
    Q3221403
    0 references
    Q5332984
    0 references
    Q5844986
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q943589&oldid=35071640"
    Powered by MediaWiki