2877 search results - page 1 / 576 » The Complexity of Planarity Testing |
STACS
2000
Springer
13 years 8 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
toris-)Rips complex of a discrete point-set P is an abstract simplicial complex in
STACS
2007
Springer
13 years 11 months ago
2007
Springer
GD
2004
Springer
13 years 10 months ago
2004
Springer
The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no e...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...