On the Computational Complexity of Upward and Rectilinear Planarity Testing (Q2784472)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Upward and Rectilinear Planarity Testing |
scientific article |
Statements
On the Computational Complexity of Upward and Rectilinear Planarity Testing (English)
0 references
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
