✦ LIBER ✦

Optimum multiway search trees

✍ Scribed by V. K. Vaishnavi; H. P. Kriegel; D. Wood

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 728 KB
Volume: 14
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient multiway radix search trees

✍ Úlfar Erlingsson; Mukkai Krishnamoorthy; T.V. Raman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 551 KB

We present a new scheme for building static search trees, using multiway radix search. We apply this method to me problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three

Optimum binary search trees

✍ Donald E. Knuth 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 39 KB

Optimum binary search trees

✍ D. E. Knuth 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 510 KB

Optimal multiway search trees for variab

Optimal multiway search trees for variable size keys

✍ Jayme Luiz Szwarcfiter 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 656 KB

Optimal multiway split trees

✍ Shou-Hsuan Stephen Huang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Minimum multiway cuts in trees

✍ Péter L. Erdős; András Frank; László Székely 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 667 KB

We compare three lower bounds for the minimum cardinality of a multiway cut in a graph separating a given set S of terminals. The main result is a relatively short algorithmic proof for a simplified version of a min-max theorem of the first and the third authors asserting that the best of the three