## Drawing Graphs Symmetrically in Three Dimensions
Hong, Seok-Hee
(2002)
Full text not available from this repository. ## AbstractIn 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 References |