✦ LIBER ✦

The uniform selection of free trees

✍ Scribed by Herbert S Wilf

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 160 KB
Volume: 2
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(81)90021-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniform Generation of Binary Trees in Pa

Uniform Generation of Binary Trees in Parallel

✍ M.D. Atkinson; J.R. Sack 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB

An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable of generating a binary tree on \(n\) nodes in time \(O(\log n)\), space \(O(n)\), with \(O(n)\) processors; it is also capable of generating various related combinatorial objects. O 1994 Academic Pre

Effect of selection on the topology of g

Effect of selection on the topology of genealogical trees

✍ Leonardo P. Maia; Alexandre Colato; José F. Fontanari 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Density of the Commensurability Groups o

Density of the Commensurability Groups of Uniform Tree Lattices

✍ Y.S. Liu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Let \(X\) be a universal cover of a finite connected graph, and \(\Gamma\) a group acting discretely and cocompactly on \(X\), i.e., a uniform lattice on \(X\). We announce a proof of the conjecture of H. Bass and R. Kulkarni (J. Amer. Math. Soc. No. 4 (1990), 843-902) that the commensurability grou

Flexibility of Steiner trees in uniform

Flexibility of Steiner trees in uniform orientation metrics

✍ M. Brazil; P. Winter; M. Zachariasen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

Binary trees and uniform distribution of

Binary trees and uniform distribution of traffic cutback

✍ Shuo-Yen Robert Li 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 803 KB

On the uniformity of the closed-set latt

On the uniformity of the closed-set lattice of a tree

✍ K.M. Koh; K.S. Poh 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < ¢\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if