The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.”

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.

The triangles method to build X -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer X -trees (valued trees having X as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 n -3 distance values between the n elements of X , if they fulfill some explicit conditions. This construction is based on the mapping between X -tree and a weighted generalized 2-tree spanning X .

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity: