## A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs
Hong, Seok-Hee and Eades, Peter
(2004)
Full text not available from this repository. ## AbstractThis paper presents a linear time algorithm for constructing maximally symmetric straight-line drawings of biconnected and one-connected planar graphs. This research was partially supported by a grant from the Australian Research Council. For the full version of this paper, see [7,8]. National ICT Australia is funded by the Australian Governmentrsquos Backing Australiarsquos Ability initiative, in part through the Australian Research Council.
Repository Staff Only: item control page References |