Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
We report on the results of an experimental study in which we have
compared the performances of three algorithms for drawing general cubic
graphs on the bidimensional orthogonal grid.
The comparison works on 18,000 randomly generated graphs with up to 300
vertices and analyzes the number of bends and crossings,
the area, the edge length and the running time.
PS Files
Journal
Version