Title :
Comments on "O(n/sup 2/) algorithms for graph planarization
Author :
Takefuji, Yoshiyasu ; Lee, Kuo Chun ; Cho, Yong Beom
Author_Institution :
Dept. of Electr. Eng., Case Western Reserve Univ., Cleveland, OH, USA
Abstract :
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.<>
Keywords :
computational complexity; graph theory; parallel algorithms; O(n/sup 2/) algorithms; graph planarization; maximal planar subgraph; maximum planar subgraph; parallel algorithm; space-time product complexity; Computational modeling; Design automation; Parallel algorithms; Planarization; Printed circuits; Routing; Very large scale integration;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
