Drawing Graphs in Parallel Lines with Artificial Neural Networks

In this work, we propose the use of a multivalued recurrent neural network with the aim of graph drawing. Particularly, the problem of drawing a graph in two parallel lines with the minimum number of crossings between edges is studied, and a formulation for this problem is presented. The neural model MREM is used to solve this problem. This model has been successfully applied to other optimization problems. In this case, a slightly different version is used, in which the neuron state is represented by a two dimensional discrete vector, representing the nodes assigned to a given position in each of the parallel lines. Some experimental simulations have been carried out in order to compare the efficiency of the neural network with a heuristic approach designed to solve the problem at hand. These simulations confirm that our neural model outperforms the heuristic approach, obtaining a lower number of crossings on average.

[1]  H. Abut,et al.  System of associative relationships (SOAR) , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[2]  Enrique Mérida Casermeiro,et al.  Graph Partitioning via Recurrent Multivalued Neural Networks , 2005, IWANN.

[3]  Emilio Di Giacomo,et al.  Drawing Bipartite Graphs on Two Curves , 2006, Graph Drawing.

[4]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[5]  Enrique Mérida Casermeiro,et al.  Image Compression by Vector Quantization with Recurrent Discrete Networks , 2006, ICANN.

[6]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[7]  Sartaj Sahni,et al.  Single Row Routing , 1983, IEEE Transactions on Computers.

[8]  Enrique Mérida Casermeiro.  Red neuronal recurrente multivaluada para el reconocimiento de patrones y la optimización combinatoria , 2000 .

[9]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[10]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[11]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[12]  Enrique Mérida Casermeiro,et al.  K -Pages Graph Drawing with Multivalued Neural Networks , 2007, ICANN.

[13]  Enrique Mérida Casermeiro,et al.  An N-parallel Multivalued Network: Applications to the Travelling Salesman Problem , 2003, IWANN.

[14]  F. Sinden.  Topology of thin film RC circuits , 1966 .

[15]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[16]  Enrique Mérida Casermeiro,et al.  An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem , 2001, Neural Processing Letters.

[17]  Robert J. Cimikowski,et al.  Algorithms for the fixed linear crossing number problem , 2002, Discret. Appl. Math..

[18]  Yusuf Öztürk,et al.  A New Family of Multivalued Networks , 1996, Neural Networks.

[19]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[20]  Seth M. Malitz,et al.  Graphs with E Edges Have Pagenumber O(sqrt(E)) , 1994, J. Algorithms.