By Topic

An efficient parallel algorithm for two-layer planarization in graph drawing

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)

We present a parallel algorithm for the two-layer planarization problem using a gradient ascent learning of Hopfield network. This algorithm which is designed to embed a two-layer graph on a plane, uses the Hopfield network to get a near-maximal planar subgraph, and increases the energy by modifying weights in a gradient ascent direction to help the Hopfield network escape from the state of near-maximal planar subgraph to the state of the maximal planar subgraph. The experimental results show that the proposed algorithm can generate better solutions than the traditional Hopfield network.

Published in:

TENCON '02. Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering  (Volume:3 )

Date of Conference:

28-31 Oct. 2002