Comments on "O(n/sup 2/) algorithms for graph planarization
Yoshiyasu Takefuji, K.C. Lee, Y.B. Cho · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1991
For the original article see ibid., vol.8, no.3, p.257-67 (1989). The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. in the above-mentioned paper. The space-time product complexity is also compared.>