Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.
Schaeffer, Gilles (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Counting unrooted maps using tree-decomposition.”
Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The two uniform infinite quadrangulations of the plane have the same law
Laurent Ménard (2010)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We prove that the uniform infinite random quadrangulations defined respectively by Chassaing–Durhuus and Krikun have the same distribution.
Bases of classes of trees closed under subdivisions
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
Distances between rooted trees
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
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...
Planar maps as labeled mobiles.
Bouttier, J., Di Francesco, P., Guitter, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: