References
- Catarci , T. 1990 . Submitted for publication to International Journal of Foundations of Computer Science . The Assignment Heuristic for Crossing Reduction ,
- Catarci , T. 1988 . The assignment heuristic for crossing reduction in bipartite graphs . Proc. Twenty-Sixth Annual Allerton Conf. on Communication, Control and Computing . 1988 , Monticello, Ill. pp. 1138 – 1139 .
- Eades , P. and Kelly , D. 1986 . Heuristics for drawing 2-layered networks . Ars Combinatoria , 21A : 89 – 98 .
- Eades P. McKay B. Wormald N. An NP-Complete Crossing Number Problem for Bipartite Graphs Dept. of Computer Science, University of Queensland St.Lucia April 1985 Tech. Report No. 60
- Eades P. Wormald N. The Median Heuristic For Drawing 2-Layered Networks Dept. of Computer Science, University of Queensland St.Lucia May 1986 Tech. Report No. 69
- Eades P. Wormald N. Edge Crossings in Dran,ings of Bipartite Graph Dept. of Computer Science, University of Queensland St.Lucia March 1989 Tech. Report No. 108
- Mäkinen , E. 1989 . A note on the median heuristic for drawing bipartite graphs . Fundamenta Informaticae , XII : 563 – 570 .
- Mäkinen , E. 1990 . Experiments on drawing 2-level hierarchical graphs . Intern. J. Computer Math. , 36 : 175 – 181 .
- Makinen E. Remarks on the Assignment Heuristic for Drawing Bipartite Graphs Dept. of Computer Science, University of Tampere August 1990 Tech. Report A-1990-8
- Sugiyama , K. , Tagawa , S. and Toda , M. 1981 . Methods for visual understanding of hierarchical system structures . IEEE Trans. Syst. Man Cybern , SMC-11 : 109 – 125 .