On the characterization of level planar trees by minimal patterns

Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages69-80
Number of pages12
Volume5849 LNCS
DOIs
StatePublished - 2010
Event17th International Symposium on Graph Drawing, GD 2009 - Chicago, IL, United States
Duration: Sep 22 2009Sep 25 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5849 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other17th International Symposium on Graph Drawing, GD 2009
CountryUnited States
CityChicago, IL
Period9/22/099/25/09

Fingerprint

Iterative methods
Iteration
Arbitrary

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Estrella-Balderrama, A., Fowler, J. J., & Kobourov, S. G. (2010). On the characterization of level planar trees by minimal patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 69-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5849 LNCS). https://doi.org/10.1007/978-3-642-11805-0_9

On the characterization of level planar trees by minimal patterns. / Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Kobourov, Stephen G.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5849 LNCS 2010. p. 69-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5849 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Estrella-Balderrama, A, Fowler, JJ & Kobourov, SG 2010, On the characterization of level planar trees by minimal patterns. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5849 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5849 LNCS, pp. 69-80, 17th International Symposium on Graph Drawing, GD 2009, Chicago, IL, United States, 9/22/09. https://doi.org/10.1007/978-3-642-11805-0_9
Estrella-Balderrama A, Fowler JJ, Kobourov SG. On the characterization of level planar trees by minimal patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5849 LNCS. 2010. p. 69-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-11805-0_9
Estrella-Balderrama, Alejandro ; Fowler, J. Joseph ; Kobourov, Stephen G. / On the characterization of level planar trees by minimal patterns. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5849 LNCS 2010. pp. 69-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{93e1c6f321e64f2e99e5150674a73af3,
title = "On the characterization of level planar trees by minimal patterns",
abstract = "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.",
author = "Alejandro Estrella-Balderrama and Fowler, {J. Joseph} and Kobourov, {Stephen G}",
year = "2010",
doi = "10.1007/978-3-642-11805-0_9",
language = "English (US)",
isbn = "3642118046",
volume = "5849 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "69--80",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On the characterization of level planar trees by minimal patterns

AU - Estrella-Balderrama, Alejandro

AU - Fowler, J. Joseph

AU - Kobourov, Stephen G

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77951547402&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951547402&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-11805-0_9

DO - 10.1007/978-3-642-11805-0_9

M3 - Conference contribution

SN - 3642118046

SN - 9783642118043

VL - 5849 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 69

EP - 80

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -