Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.

Bonichon, Nicolas; Gavoille, Cyril; Hanusse, Nicolas

Displaying similar documents to “Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.”

Variations for spanning trees.

Zsakó, László (2006)

Annales Mathematicae et Informaticae

Similarity:

Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.

Garg, Ashim, Rusu, Adrian (2004)

Journal of Graph Algorithms and 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:

Trees and meta-Fibonacci sequences.

Isgur, Abraham, Reiss, David, Tanny, Stephen (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the distribution of depths in increasing trees.

Kuba, Markus, Wagner, Stephan (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Splaying a search tree in preorder takes linear time.

Chaudhuri, R., Höft, H. (1991)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Programming and Testing a Two-Tree Algorithm

Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...