A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

[1]  Rafael Martí,et al.  A tabu thresholding algorithm for arc crossing minimization in bipartite graphs , 1996, Ann. Oper. Res..

[2]  Ioannis G. Tollis,et al.  Automatic layout of PERT diagrams with X-PERT , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[3]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[4]  G. Battista,et al.  Hierarchies and planarity theory , 1988, IEEE Trans. Syst. Man Cybern..

[5]  R. Tamassia,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

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

[7]  Férid Aoudja,et al.  CASE: automatic generation of electrical diagrams , 1986 .

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

[9]  Marie-Jose Carpano,et al.  Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Rafael Martí Cunquero.  Técnicas exactas y heurísticas en el diseño automático de redes de planificación de proyectos , 1993 .

[12]  Paul G. Sorenson,et al.  Towards the Automatic Generation of Software Diagrams , 1991, IEEE Trans. Software Eng..

[13]  Jyrki Nummenmaa,et al.  Constructing Layouts for ER-Diagrams from Visibility-Representations , 1990, ER.

[14]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[15]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[16]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .