An algorithm for drawing general undirected graphs

Batini, 1986, A layout algorithm for data flow diagrams, IEEE Trans. Software Eng., SE-12, 538, 10.1109/TSE.1986.6312901

Becker, 1987, On the optimal layout of planar graphs with fixed boundary, SIAM J. Comput., 16, 946, 10.1137/0216061

Behzad, 1979

Carpano, 1980, Automatic display of hierarchized graphs for computer-aided decision analysis, IEEE Trans. Syst., Man, Cybern., SMC-10, 705, 10.1109/TSMC.1980.4308390

Corneil, 1970, An efficient algorithm for graph isomorphism, J. ACM, 17, 51, 10.1145/321556.321562

Eades, 1984, A heuristics for graph drawing, Congr. Numer., 42, 149

Eades, 1987, Algorithms for drawing graphs: An annotated bibliography

Floyd, 1962, Algorithm 97: shortest path, Comm. ACM, 5, 345, 10.1145/367766.368168

Hopcroft, 1973, A V log V algorithm for isomorphism of triconnected of planar graphs, J. Comput. Syst. Sci., 7, 323, 10.1016/S0022-0000(73)80013-3

Kamada, 1988, Automatic display of network structures for human understanding

Lipton, 1985, A method for drawing graphs, Proc. ACM Symposium on Computational Geometry, 153, 10.1145/323233.323254

Mittal, 1988, A fast backtrack algorithm for graph isomorphism, Inform. Process. Lett., 29, 105, 10.1016/0020-0190(88)90037-3

Moffat, 1985, An all pairs shortest path algorithm with expected running time O(n2log n), Proc. Conf. Found. Comp. Sci., 101

Rowe, 1987, A browser for directed graphs, Software Pract. Exper., 17, 61, 10.1002/spe.4380170107

Sedgewick, 1983

Spira, 1973, A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n), SIAM J. Comput., 2, 28, 10.1137/0202004

Sugiyama, 1985, Achieving uniqueness requirement in drawing digraphs: optimum code algorithm and hierarchy isomorphism

Sugiyama, 1981, Methods for visual understanding of hierarchical system structures, IEEE Trans. Syst. Man, Cybern., SMC-11, 109, 10.1109/TSMC.1981.4308636

Tamassia, 1988, Automatic graph drawing and readability of diagrams, IEEE Trans. Syst. Man, Cybern., SMC-18, 61, 10.1109/21.87055

Tutte, 1963, How to draw a graph, Proc. London Math. Soc., 3, 743, 10.1112/plms/s3-13.1.743

Warfield, 1977, Crossing theory and hierarchy mapping, IEEE Trans. Syst. Man, Cybern., SMC-7, 505, 10.1109/TSMC.1977.4309760