On the complexity of crossings in permutations (Q1011761)

From MaRDI portal
Revision as of 00:34, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On the complexity of crossings in permutations
scientific article

    Statements

    On the complexity of crossings in permutations (English)
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    crossing minimization
    0 references
    rank aggregation
    0 references
    Kendall-\(\tau \) distance
    0 references
    NP-hardness approximations
    0 references

    Identifiers

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