A Framework for Circular Drawings of Networks

Six, Janet M. and Tollis, Ioannis G. (1999) A Framework for Circular Drawings of Networks. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 107-116(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_11).

Full text not available from this repository.

Abstract

Drawings of graphs which show the inherent strenghts and weaknesses of structures with clustered views would be advantageous additions to many network design tools. In this paper we present a framework for producing circular drawings of networks represented by non-biconnected graphs. Furthermore, the drawings produced by these techniques clearly show the biconnectivity structure of the given networks. We also include results of an extensive experimental study which shows our approach to significantly outperform the current state of the art.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_11
Classifications: P Styles > P.720 Straight-line
G Algorithms and Complexity > G.350 Clusters
P Styles > P.120 Circular
URI: http://gdea.informatik.uni-koeln.de/id/eprint/277

Actions (login required)

View Item View Item