Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4323925872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Bend Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spirality and Optimal Orthogonal Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal planarity testing of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5358292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: HV-planarity: algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Upward and Rectilinear Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends / rank
 
Normal rank

Latest revision as of 00:06, 3 August 2024

scientific article; zbMATH DE number 7742466
Language Label Description Also known as
English
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
scientific article; zbMATH DE number 7742466

    Statements

    Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    orthogonal drawings
    0 references
    bend minimization
    0 references
    linear-time algorithms
    0 references
    plane graphs
    0 references
    series-parallel graphs
    0 references

    Identifiers