A Layout algoritm for hierarchical graphs with constraints

Show full item record

Redirect: RIT Scholars content from RIT Digital Media Library has moved from http://ritdml.rit.edu/handle/1850/11724 to RIT Scholar Works http://scholarworks.rit.edu/theses/634, please update your feeds & links!
Title: A Layout algoritm for hierarchical graphs with constraints
Author: Slade, Michael
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.
Record URI: http://hdl.handle.net/1850/11724
Date: 1994

Files in this item

Files Size Format View
MSladeThesis09-02-1994.pdf 2.183Mb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML

Advanced Search