By Topic

An efficient parallel algorithm for planarization problem

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)
Rong Long Wang ; Fac. of Eng., Toyama Univ., Japan ; Zheng Tang ; Qi Ping Cao

A parallel algorithm for solving the planarization problem using a gradient ascent learning of Hopfield network is presented. This algorithm which is designed to embed a graph on a plane, uses the Hopfield neural network to get a near-maximal planar subgraph, and increase the energy by modifying weights in a gradient ascent direction to help the network escape from the state of the near-maximal planar subgraph to the state of the maximal planar subgraph or better one. The proposed algorithm is verified by a large number of simulation runs and compared with other parallel algorithms for the planarization problem. The experimental results show that the proposed algorithm can generate as good as or better solutions than the other existing parallel algorithm for the planarization problem

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:49 ,  Issue: 3 )