Edge crossings in drawings of bipartite graphs
- 1 April 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 11 (4) , 379-403
- https://doi.org/10.1007/bf01187020
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- DAG—a program that draws directed graphsSoftware: Practice and Experience, 1988
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988
- Fundamentals of planar ordered setsDiscrete Mathematics, 1987
- A browser for directed graphsSoftware: Practice and Experience, 1987
- Crossing Number is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1983
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Graph Theory with ApplicationsPublished by Springer Nature ,1976