Genetic algorithms for drawing bipartite graphs

References

• Bienstock , D. 1990 . Some provably hard crossing number problems . Proc. 8th Annual ACM Symp. on computational Geometry , : 253 – 260 .
   Google Scholar
• Di Battista G. Eades P. Tamassia R. Tollis I.G. Mauer A. Algorithms for graph drawing: an annotated bibliography Manuscript June 1993
   Google Scholar
• Eades , P. and Kelly , D. 1986 . Heuristics for drawing 2-layered networks . Ars Combin , 21 : 89 – 98 .
   Google Scholar
• Eades , P. , Mckay , B. and Wormald , N. 1985 . “ An NP-complete crossing number problem for bipartite graphs ” . University of Queensland, St. Lucia : Technical Report .
   Google Scholar
• Eades , P. and Wormald , N. 1986 . “ The median heuristic for drawing 2-layered networks ” . University of Queensland, St. Lucia : Technical Report .
   Google Scholar
• Eades P. Wormald N. Edge crossings in drawings of bipartite graphs Tech. Report No. 108 Dept. of Computer Science, University of Queensland St. Lucia March 1989
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1983 . Crossing number is NP-complete . SI AM J. Algebraic Discrete Methods , 4 : 312 – 316 .
   Web of Science ®Google Scholar
• Koebe , M. and Knochel , J. 1990 . On the block alignment proble . J. Inf. Process. Cybern , 26 : 377 – 387 .
   Google Scholar
• Makinen , E. 1989 . A note on the median heuristic for drawing bipartite graphs . Fund. Inform , 4 : 563 – 569 .
   Google Scholar
• Makinen , E. 1990 . Experiments on drawing 2-level hierarchical graphs . Intern. J. Comput. Math , 36 : 175 – 181 .
   Web of Science ®Google Scholar
• May , M. and Szkatula , K. 1988 . On the bipartite crossing number . Control Cybernet , 17 ( 1 ) : 85 – 98 .
   Google Scholar
• Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs Springer 1992
   Google Scholar
• Sugiyama , K. , Tagawa , S. and Toda , M. 1981 . Methods for visual understanding of hierarchical system structures . IEEE Trans. Syst. Man Cybern , 11 ( 1 ) : 109 – 125 .
   Web of Science ®Google Scholar
• Tutte , W. T. 1970 . Toward a theory of crossing numbers . J. Combin , 8 ( 1 ) : 45 – 53 .
   Google Scholar
• Warfield , J. N. 1977 . Crossing theory and hierarchy mapping . IEEE Trans. Syst. Man Cybern , 7 ( 1 ) : 505 – 523 .
   Web of Science ®Google Scholar
• Watkins , M. E. 1970 . A special crossing number for bipartite graphs: a research problem . Ann. New York Acad. Sci , 175 ( 1 ) : 405 – 410 .
   Web of Science ®Google Scholar