Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.”
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Efficient drawing of RNA secondary structure.
Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)
Journal of Graph Algorithms and Applications
Similarity:
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Updating approximately complete trees
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Trees and meta-Fibonacci sequences.
Isgur, Abraham, Reiss, David, Tanny, Stephen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
Journal of Graph Algorithms and Applications
Similarity: