Definition: The problem of representing a graph in a plane "neatly," for instance with a minimum number of edge crossings.
See also grid drawing, orthogonal drawing, straight-line drawing, planar graph, planarization.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 8 December 2008.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "graph drawing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 8 December 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/graphdrawing.html