✦ LIBER ✦

Generation and ranking of K-ary trees

✍ Scribed by Shmuel Zaks

Book ID: 113162513
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 525 KB
Volume: 14
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90140-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shifts and loopless generation of k-ary

Shifts and loopless generation of k-ary trees

✍ James F. Korsh; Seymour Lipschutz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 388 KB

A new shift operation on nodes of k-ary trees which preserves preorder node numbers is introduced. The shift graph SG,,k has as vertices all n-node k-ary trees and edges corresponding to one shift. The graph is proven to have a Hamiltonian path and an algorithm is presented which generates all n-nod

Loopless generation of k-ary tree sequen

Loopless generation of k-ary tree sequences

✍ James F. Korsh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Bandwidth of the complete k-ary tree

✍ Lawren Smithline 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 524 KB

We determine, constructively, the bandwidth of the complete k-ary tree on d levels. By rectifying an algorithm of Chung (1988), we establish B( Tk,J = rk(kd -1)/(2d( k -1)) 1. ## 1. Praeludium The bandwidth problem for a graph G is a question about numbering the vertices of G so the maximum differ

Generalized vertex-rankings of trees

✍ Xiao Zhou; Nobuaki Nagai; Takao Nishizeki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 622 KB

Fast random generation of binary, t-ary

Fast random generation of binary, t-ary and other types of trees

✍ Adolfo J. Quiroz 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 570 KB

Onk-ary spanning trees of tournaments

✍ Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any