An algorithm for drawing general undirected graphs
- 16 April 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (1), 7-15
- https://doi.org/10.1016/0020-0190(89)90102-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A fast backtrack algorithm for graph isomorphismInformation Processing Letters, 1988
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988
- On the Optimal Layout of Planar Graphs with Fixed BoundarySIAM Journal on Computing, 1987
- A browser for directed graphsSoftware: Practice and Experience, 1987
- A method for drawing graphsPublished by Association for Computing Machinery (ACM) ,1985
- A V log V algorithm for isomorphism of triconnected planar graphsJournal of Computer and System Sciences, 1973
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- How to Draw a GraphProceedings of the London Mathematical Society, 1963
- Algorithm 97: Shortest pathCommunications of the ACM, 1962