An Algorithm for Drawing General Undirected Graphs

[1]  H. B. Mittal,et al.  A Fast Backtrack Algorithm for Graph Isomorphism , 1988, Inf. Process. Lett..

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

[3]  Bernd Becker,et al.  On the Optimal Layout of Planar Graphs with Fixed Boundary , 1987, SIAM J. Comput..

[4]  Lawrence A. Rowe,et al.  A browser for directed graphs , 1987, Softw. Pract. Exp..

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

[6]  Alistair Moffat,et al.  An all pairs shortest path algorithm with expected running time O(n 2logn) , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Richard J. Lipton,et al.  A method for drawing graphs , 1985, SCG '85.

[8]  Peter Eades,et al.  A Heuristics for Graph Drawing , 1984 .

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

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

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

[12]  Robert E. Tarjan,et al.  A V log V Algorithm for Isomorphism of Triconnected Planar Graphs , 1973, J. Comput. Syst. Sci..

[13]  Philip M. Spira,et al.  A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..

[14]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[15]  W. T. Tutte.  How to Draw a Graph , 1963 .

[16]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.