A technique for drawing directed graphs
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 19 (3) , 214-230
- https://doi.org/10.1109/32.221135
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- DAG—a program that draws directed graphsSoftware: Practice and Experience, 1988
- ON THE PROBLEM OF PLACING NAMES IN A GEOGRAPHIC MAPInternational Journal of Pattern Recognition and Artificial Intelligence, 1987
- A browser for directed graphsSoftware: Practice and Experience, 1987
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- 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
- A network simplex methodMathematical Programming, 1976