2010 | OriginalPaper | Buchkapitel
On the Characterization of Level Planar Trees by Minimal Patterns
verfasst von : Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
Erschienen in: Graph Drawing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider characterizations of level planar trees. Healy
et al.
[8] characterized the set of trees that are level planar in terms of two minimal level non-planar (
MLNP
) patterns. Fowler and Kobourov [7] later proved that the set of patterns was incomplete and added two additional patterns. In this paper, we show that the characterization is still incomplete by providing new
MLNP
patterns not included in the previous characterizations. Moreover, we introduce an iterative method to create an arbitrary number of
MLNP
patterns, thus proving that the set of minimal patterns that characterizes level planar trees is infinite.