.png){kind=icon}
Return
An efficient parallel algorithm for planarization problem
.png){kind=icon}
PRE
AI
DOI：10.1109/81.989179.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
gradient ascent learning
Hopfield neural network
maximal planar subgraph
NP-complete problem
planarization problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.2
Papers:
9.8K
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more