A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs |
scientific article; zbMATH DE number 5786342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs |
scientific article; zbMATH DE number 5786342 |
Statements
A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (English)
0 references
16 September 2010
0 references
graph drawing
0 references
convex drawing
0 references
symmetric drawing
0 references
geometric automorphism
0 references
internally triconnected plane graphs
0 references
symmetry
0 references
planar graphs
0 references
triconnected planar graphs
0 references
angle-constrained graph drawing
0 references
0 references
0.8805004358291626
0 references
0.8164106607437134
0 references
0.814299464225769
0 references
0.8099470734596252
0 references
