Ranking and Drawing in Subexponential Time (Q3000521)

From MaRDI portal
Revision as of 01:22, 4 July 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
Ranking and Drawing in Subexponential Time
scientific article

    Statements

    Ranking and Drawing in Subexponential Time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2011
    0 references
    Kemeny aggregation
    0 references
    one-sided crossing minimization
    0 references
    parameterized complexity
    0 references
    subexponential-time algorithms
    0 references
    social choice theory
    0 references
    graph drawing
    0 references
    directed feedback arc set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references