Untangling circular drawings: algorithms and complexity (Q6101838): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4636453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Book Embedding Problems / 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: Upper Bound Constructions for Untangling Planar Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling polygons and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of $K_{2,4}$-Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching among intervals and compact routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling planar graphs from a specified vertex position-Hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and Generation of a New Graph Planarity Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-length ratio of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a polygon / 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: A framework and algorithms for circular drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the obfuscation complexity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Szekeres theorem for cyclic permutations / rank
 
Normal rank

Latest revision as of 10:08, 1 August 2024

scientific article; zbMATH DE number 7699083
Language Label Description Also known as
English
Untangling circular drawings: algorithms and complexity
scientific article; zbMATH DE number 7699083

    Statements

    Untangling circular drawings: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2023
    0 references
    straight-line graph drawing
    0 references
    outerplanarity
    0 references
    NP-hardness
    0 references
    untangling
    0 references
    permutations
    0 references

    Identifiers