On the complexity of crossings in permutations (Q1011761): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median linear orders: Heuristics and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and dynamic rank aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking cycles for minimizing crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound on the one-sided minimum crossing number in two-layered drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank

Latest revision as of 12:00, 1 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing minimization
    0 references
    rank aggregation
    0 references
    Kendall-\(\tau \) distance
    0 references
    NP-hardness approximations
    0 references
    0 references