On the computational complexity of upward and rectilinear planarity testing (Q2784472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1732360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of upward and rectilinear planarity testing |
scientific article; zbMATH DE number 1732360 |
Statements
23 April 2002
0 references
graph drawing
0 references
planar drawing
0 references
upward drawing
0 references
rectilinear drawing
0 references
orthogonal drawing
0 references
layout
0 references
ordered set
0 references
planar graph
0 references
algorithm
0 references
computational complexity
0 references
NP-complete problem
0 references
approximation algorithm
0 references
0.9360765
0 references
0.9326144
0 references
0 references
0.91639435
0 references
0.9107331
0 references
0 references
0.8866452
0 references
0.88539994
0 references
On the computational complexity of upward and rectilinear planarity testing (English)
0 references
