Drawing planar graphs using the canonical ordering (Q1920418): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A linear algorithm to find a rectangular dual of a planar triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / 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: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement and symmetry display of planar upward drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Angles of planar triangular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / 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: On Finding the Rectangular Duals of Planar Triangular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar embedding: linear-time algorithms for vertex placement and edge orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytical Solution of Vector Diffraction for Focusing Optical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: At most single-bend embeddings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical results on at most 1-bend embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing compact rectilinear planar layouts using canonical representation of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal-node-cost planar embeddings / 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: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for planar orthogonal drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity and duality of finite and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zum Vierfarbenproblem / rank
 
Normal rank

Revision as of 14:06, 24 May 2024

scientific article
Language Label Description Also known as
English
Drawing planar graphs using the canonical ordering
scientific article

    Statements

    Drawing planar graphs using the canonical ordering (English)
    0 references
    0 references
    0 references
    17 November 1996
    0 references
    0 references
    graph-drawing problems
    0 references
    visibility representations
    0 references
    0 references
    0 references
    0 references
    0 references