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 Black.
Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.
Cite this as:
Paul E. Black, "graph drawing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/graphdrawing.html