Automatic Graph Drawing Algorithms
In this paper are high level summaries of three automatic graph drawing
algorithms: the Kamada spring method, the Davidson and Harel simulated
annealing method and the Sugiyama method for hierarchical graphs. I
wrote this report for an introduction to graph theory course that I took
in the fall of 1996.