By Topic

Solving a near-maximal graph planarization problem using strictly digital neural networks with virtual slack-neurons

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
$33 $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)
K. Murakami ; Dept. of Inf. & Control Eng., Toyota Technol. Inst., Nagoya, Japan ; T. Nakagawa ; H. Kitagawa

This paper presents a neural network parallel algorithm for solving a near optimum graph planarization problems using SDNN/V (strictly digital neural networks enhanced with virtual slack-neurons). The proposed algorithm generates a near-maximal planar subgraph from a nonplanar or a planar graph within O(1) time. The problem can be defined as a “set selection problem” based on the “between-l-and-k-out-of-n” design rule in SDNN/V algorithm, The results of solving the graph planarization problem using a simulator of SDNN/V show that the computation in parallel execution is only three steps to get one of the near-optimum solutions. However, the obtained solutions are not always maximal subgraphs. In order to improve the quality of the solutions, this paper presents a numbering method for neurons in an order of importance within each constraint satisfaction set. From the result of simulation, it is shown that the numbering method has an effect on improving the quality of the solutions

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994