✦ LIBER ✦

Protected points in k-ary trees

✍ Scribed by Toufik Mansour

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 182 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.10.045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Protected points in ordered trees

✍ Gi-Sang Cheon; Louis W. Shapiro 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 198 KB

In this note we start by computing the average number of protected points in all ordered trees with n edges. This can serve as a guide in various organizational schemes where it may be desirable to have a large or small number of protected points. We will also look a few subclasses with a view to in

Self-Adjusting k-ary Search Trees

✍ M. Sherk 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present an online self-adjusting \(k\)-ary search tree, the \(k\)-splay tree, as a generalization of the binary splay tree. We prove a \(k\)-ary analogue of Sleator and Tarjan's splay tree access lemma using a considerably more complicated argument based on their technique. This lemma is used to

Embedding K-ary Complete Trees into Hype

Embedding K-ary Complete Trees into Hypercubes

✍ X.J. Shen; Q. Hu; W.F. Liang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 529 KB

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

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

Loopless generation of k-ary tree sequen

Loopless generation of k-ary tree sequences

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