By Topic

Comments on "O(n/sup 2/) algorithms for graph planarization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Takefuji, Y. ; Dept. of Electr. Eng., Case Western Reserve Univ., Cleveland, OH, USA ; Lee, K.C. ; Cho, Y.B.

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.<>

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:10 ,  Issue: 12 )