K-pages graph drawing with multivalued neural networks

Authors:
Domingo López-Rodríguez;Enrique Mérida-Casermeiro;Juan M. Ortíz-de-Lazcano-Lobato;Gloria Galán-Marín
Affiliations:
Department of Applied Mathematics, University of Málaga, Málaga, Spain;Department of Applied Mathematics, University of Málaga, Málaga, Spain;Department of Computer Science and Artificial Intelligence, University of Málaga, Málaga, Spain;Department of Electronics and Electromechanical Engineering, University of Extremadura, Badajoz, Spain
Venue:
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Year:
2007

Citing 14
Cited 1

Embedding graphs in books: a layout problem with applications to VLSI design

SIAM Journal on Algebraic and Discrete Methods
Automatic graph drawing and readability of diagrams

IEEE Transactions on Systems, Man and Cybernetics
Crossing Minimization in Linear Embeddings of Graphs

IEEE Transactions on Computers
Neural network parallel computing

Neural network parallel computing
Graphs with E edges have pagenumber E O

Journal of Algorithms
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
Algorithms for the fixed linear crossing number problem

Discrete Applied Mathematics
Computational Aspects of VLSI

Computational Aspects of VLSI
An analysis of some linear graph layout heuristics

Journal of Heuristics
Single Row Routing

IEEE Transactions on Computers
An N-parallel multivalued network: applications to the travelling salesman problem

IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Image compression by vector quantization with recurrent discrete networks

ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
Graph partitioning via recurrent multivalued neural networks

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A neural-network algorithm for a graph layout problem

IEEE Transactions on Neural Networks

Shortest common superstring problem with discrete neural networks

ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the K-pages graph layout problem is solved by a new neural model. This model consists of two neural networks performing jointly in order to minimize the same energy function. The neural technique applied to this problem allows to reduce the energy function by changing outputs from both networks -outputs of first network representing location of nodes in the nodes line, while the outputs of the second one meaning the page where the edges are drawn. A detailed description of the model is presented, and the technique to minimize an energy function is fully described. It has proved to be a very competitive and efficient algorithm, in terms of quality of solutions and computational time, when compared to the state-of-the-art heuristic methods specifically designed for this problem. Some simulation results are presented in this paper, to show the comparative efficiency of the methods.