A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803): 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: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for one-sided crossing minimization revisited / 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: Ranking and Drawing in Subexponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the one-sided crossing minimization in a bipartite graph with large degrees / 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

Latest revision as of 17:48, 10 July 2024

scientific article
Language Label Description Also known as
English
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
scientific article

    Statements

    A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed parameter algorithm
    0 references
    graph drawing
    0 references
    subexponential time
    0 references
    0 references
    0 references