A divide-and-conquer algorithm for the automatic layout of large directed graphs

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 is described in detail. This algorithm produces especially good results on large graphs of several hundred vertices.