A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- 19 April 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 90 (2), 303-319
- https://doi.org/10.1016/0377-2217(95)00356-8
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Towards the automatic generation of software diagramsIEEE Transactions on Software Engineering, 1991
- Planar grid embedding in linear timeIEEE Transactions on Circuits and Systems, 1989
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988
- Hierarchies and planarity theoryIEEE Transactions on Systems, Man, and Cybernetics, 1988
- CASE: automatic generation of electrical diagramsComputer-Aided Design, 1986
- A layout algorithm for data flow diagramsIEEE Transactions on Software Engineering, 1986
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Automatic Display of Hierarchized Graphs for Computer-Aided Decision AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1980
- Crossing Theory and Hierarchy MappingIEEE Transactions on Systems, Man, and Cybernetics, 1977