The symmetry number problem for trees
Journal
Information Processing Letters
Journal Volume
79
Journal Issue
2
Pages
73-79
Date Issued
2001
Author(s)
Chin K.-W
Abstract
For trees, we define the notion of the so-called symmetry number to measure the size of the maximum subtree that exhibits an axial symmetry in graph drawing. For unrooted unordered trees, we are able to demonstrate a polynomial time algorithm for computing the symmetry number. © 2001 Elsevier Science B.V.
Subjects
Design of algorithms; Graph drawing
Other Subjects
Computational complexity; Polynomials; Trees (mathematics); Design of algorithms; Polynomial time algorithms; Algorithms
Type
journal article