License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2018.32
URN: urn:nbn:de:0030-drops-89259
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8925/
Ralaivaosaona, Dimbinaina ;
Ravelomanana, Jean Bernoulli ;
Wagner, Stephan
Counting Planar Tanglegrams
Abstract
Tanglegrams are structures consisting of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the two trees. We say that a tanglegram is planar if it can be drawn in the plane without crossings. Using a blend of combinatorial and analytic techniques, we determine an asymptotic formula for the number of planar tanglegrams with n leaves on each side.
BibTeX - Entry
@InProceedings{ralaivaosaona_et_al:LIPIcs:2018:8925,
author = {Dimbinaina Ralaivaosaona and Jean Bernoulli Ravelomanana and Stephan Wagner},
title = {{Counting Planar Tanglegrams}},
booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-078-1},
ISSN = {1868-8969},
year = {2018},
volume = {110},
editor = {James Allen Fill and Mark Daniel Ward},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8925},
URN = {urn:nbn:de:0030-drops-89259},
doi = {10.4230/LIPIcs.AofA.2018.32},
annote = {Keywords: rooted binary trees, tanglegram, planar, generating functions, asymptotic enumeration, singularity analysis}
}
|
Keywords: |
|
rooted binary trees, tanglegram, planar, generating functions, asymptotic enumeration, singularity analysis |
|
Collection: |
|
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
18.06.2018 |
