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, Vienna, Austria , pp. 189-204 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_16).
Full text not available from this repository.
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.
Repository Staff Only: item control page