Drawing Graphs Symmetrically in Three Dimensions

Hong, Seok-Hee (2002) Drawing Graphs Symmetrically in Three Dimensions. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 189-204(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_16).

Full text not available from this repository.

Abstract

In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_16
Classifications: P Styles > P.780 Symmetric
G Algorithms and Complexity > G.910 Symmetries
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/510

Actions (login required)

View Item View Item