Graph Layout Through the VCG Tool

Sander, Georg (1995) Graph Layout Through the VCG Tool. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 194-205(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_371).

Full text not available from this repository.

Abstract

The VCG tool allows to visualize graphs that occur typically as data structures in programs. We describe the functionality of the VCG tool, its layout algorithm and its heuristics. Our main emphasis in the selection of methods is to achieve a very good performance for the layout of large graphs. The tool supports the partitioning of edges and nodes into edge classes and nested subgraphs, the folding of regions, and the management of priorities of edges. The algorithm produces good drawings and runs reasonably fast even on very large graphs.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_371
Classifications: S Software and Systems > S.001 General
URI: http://gdea.informatik.uni-koeln.de/id/eprint/163

Actions (login required)

View Item View Item