CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Grid embedding of 4-connected plane 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: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Grid drawings of 4-connected plane graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank | |||
Normal rank |
Latest revision as of 20:47, 24 June 2024
scientific article; zbMATH DE number 5064533
Language | Label | Description | Also known as |
---|---|---|---|
English | CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS |
scientific article; zbMATH DE number 5064533 |
Statements
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (English)
0 references
16 October 2006
0 references
linear-time algorithm
0 references
0 references