A Solution to Bipartite Drawing Problem Using Genetic Algorithm

Crossing minimization problem in a bipartite graph is a well-known NP-Complete problem. Drawing the directed/undirected graphs such that they are easy to understand and remember requires some drawing aesthetics and crossing minimization is one of them. In this paper, we investigate an intelligent evolutionary technique i.e. Genetic Algorithm (GA) for bipartite drawing problem (BDP). Two techniques GA1 and GA2 are proposed based on Genetic Algorithm. It is shown that these techniques outperform previously known heuristics e.g., MinSort (M-Sort) and BaryCenter (BC) as well as a genetic algorithm based level permutation problem (LPP), especially when applied to low density graphs. The solution is tested over various parameter values of genetic bipartite drawing problem. Experimental results show the promising capability of the proposed solution over previously known heuristics.

[1]  Zoheir Ezziane,et al.  Experimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing Problem , 2007 .

[2]  W. T. Tutte.  Toward a theory of crossing numbers , 1970 .

[3]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[4]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[6]  E. Mäkinen,et al.  Genetic algorithms for drawing bipartite graphs , 1994 .

[7]  Matthias F. Stallmann,et al.  Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization , 2001, JEAL.

[8]  Daniel Bienstock,et al.  Some provably hard crossing number problems , 1990, SCG '90.

[9]  Tiziana Catarci,et al.  The assignment heuristic for crossing reduction , 1995, IEEE Trans. Syst. Man Cybern..

[10]  Ahsan Abdullah,et al.  Data mining using the crossing minimization paradigm , 2007 .

[11]  M. Watkins,et al.  A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM , 1970 .

[12]  Michael Jünger,et al.  Simple and Efficient Bilayer Cross Counting , 2002, J. Graph Algorithms Appl..

[13]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[14]  John Fulcher,et al.  Computational Intelligence: An Introduction , 2008, Computational Intelligence: A Compendium.

[15]  Camil Demetrescu,et al.  Breaking cycles for minimizing crossings , 2001, JEAL.

[16]  Rafael Martí.  Arc crossing minimization in graphs with GRASP , 2001 .

[17]  Rafael Martí,et al.  Arc crossing minimization in hierarchical digraphs with tabu search , 1997, Comput. Oper. Res..

[18]  Manfred Koebe,et al.  On the Block Alignment Problem , 1990, J. Inf. Process. Cybern..