Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Drawing Planar Graphs with Large Vertices and Thick Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for straight-line drawing of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank

Latest revision as of 02:26, 29 June 2024

scientific article
Language Label Description Also known as
English
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references