Chin K.-WHSU-CHUN YEN2023-06-092023-06-092001200190https://www.scopus.com/inward/record.uri?eid=2-s2.0-0035973469&doi=10.1016%2fS0020-0190%2800%2900174-5&partnerID=40&md5=1601f41bada9e6f2fcbdbcc2755ff0echttps://scholars.lib.ntu.edu.tw/handle/123456789/632495For 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.Design of algorithms; Graph drawingComputational complexity; Polynomials; Trees (mathematics); Design of algorithms; Polynomial time algorithms; Algorithmsjournal article10.1016/S0020-0190(00)00174-52-s2.0-0035973469