3 search results - page 1 / 1 » Lempel, Even, and Cederbaum Planarity Method |
WEA
2004
Springer
13 years 10 months ago
2004
Springer
ISAAC
1995
Springer
13 years 9 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
COCOON
2001
Springer
13 years 10 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...