DocumentCode :
767690
Title :
A divide-and-conquer algorithm for the automatic layout of large directed graphs
Author :
Messinger, Eli B. ; Rowe, Lawrence A. ; Henry, Robert R.
Author_Institution :
IBM Almaden Res. Center, San Jose, CA, USA
Volume :
21
Issue :
1
fYear :
1991
Firstpage :
42371
Abstract :
Methods for automatic presentation of relational information in the form of directed graphs are discussed. An overview of the graph-layout problem is presented along with a summary of several different layout algorithms. A divide-and-conquer layout algorithm called Compoze is described in detail. This algorithm produces especially good results on large graphs of several hundred vertices
Keywords :
computer graphics; directed graphs; mathematics computing; Compoze; automatic layout; divide-and-conquer algorithm; large directed graphs; relational information; Computer graphics; Computer science; Displays; Helium; Layout; Mice; Pattern recognition; Tree graphs; User interfaces; Workstations;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/21.101131
Filename :
101131
Link To Document :
بازگشت