Graphs employing clusters

Details Graphs employing clusters Graphs employing clusters

1993-09-24

1995-09-12

Nguyen, Phu K.

G06F 1500

Patent

active

054505356

ABSTRACT:
Techniques for automatically laying out directed graphs with clusters of nodes and free nodes. The techniques produce pictorial representations of the graphs in which a node in a cluster and a free node may belong to the same rank in the graph and nodes belonging to more than one cluster may belong to the same rank. The techniques have been added to the well-known DOT system for laying out directed graphs, and include a recursive technique for ranking nodes of the graph, a technique for ordering nodes within ranks which collapses subclusters into skeletons when the nodes within a cluster are ordered, and a technique for positioning the nodes after they have been ranked and ordered which obtains the x coordinates for the nodes by producing an auxiliary graph which is in effect the original graph "turned on its side" and assigning ranks to the nodes in the auxiliary graph.

REFERENCES:
K. Sugiyama, et al., "Visualization of Structural Information: Automatic Drawing of Compound Digraphs", IEEE Transactions on Systems, Man, and Cybernetics, vol. 21, No. 4, Jul./Aug. 1991, pp. 876-892.
P. Brown, et al., "An Object Oriented Layout for Directed Graphs", IEEE, 1992, pp. 164-171.
F. N. Paulisch, et al., "EDGE: An Extendible Graph Editor", Software-Practice and Experience, vol. 20(S1), S1/63-S1/88 (Jun. 1990).
E. B. Messinger, et al., "A Divide-and-Conquer Alogrithm for the Automatic Layout of Large Directed Graphs", IEEE Transactions on Systems, Man and Cybernetics, vol. 21, No. 1, Jan./Feb. 1991, pp. 3-12.

Affiliated with

Also associated with

Rating

Graphs employing clusters does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Graphs employing clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs employing clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-412838