The symmetry number problem for trees

The symmetry number problem for trees

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2001-06, Vol.79 (2), p.73-79
Hauptverfasser: Chin, Kien-Weh, Yen, Hsu-Chun
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Combinatorics
Combinatorics. Ordered structures
Design of algorithms
Exact sciences and technology
Graph drawing
Graph theory
Graphs
Information processing
Mathematics
Sciences and techniques of general use
Studies
Symmetry
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00174-5