Abstract
A new method is developed for reducing edge crossings in the layout of directed graphs for display. The method will reduce edge crossings in graphs which have constraints on the location or movement of some of the nodes. This has not been available in previously published methods. An analysis of the strategies used to choose rank pairs for edge crossing reduction shows that this choice will dramatically affect the amount of crossings eliminated. This method is directly applicable to the reduction of edge crossings in the general graph.
Publication Date
1994
Document Type
Thesis
Advisor
Porter, Gilbert
Advisor/Committee Member
Radziszowski, Stanislaw
Advisor/Committee Member
Anderson, Peter
Recommended Citation
Slade, Michael, "A layout algorithm for hierarchical graphs with constraints" (1994). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/635
Campus
RIT – Main Campus
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in December 2013.