Untangling planar graphs from a specified vertex position-Hard cases (Q534342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4945501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the length of the longest increasing subsequence of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The height of a random partial order: Concentration of measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound for untangling geometric planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling polygons and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of the longest monotone subsequence in a random permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moving Vertices to Make Drawings Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descending subsequences of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Collinear Sets in Straight-Line Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of measure and isoperimetric inequalities in product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the obfuscation complexity of planar graphs / rank
 
Normal rank

Latest revision as of 02:12, 4 July 2024

scientific article
Language Label Description Also known as
English
Untangling planar graphs from a specified vertex position-Hard cases
scientific article

    Statements

    Untangling planar graphs from a specified vertex position-Hard cases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    0 references
    combinatorial geometry
    0 references
    graph drawing
    0 references
    planar graphs
    0 references
    untangling problem
    0 references
    0 references