✦ LIBER ✦

Lexicographic ordering, ranking and unranking of combinations

✍ Scribed by Er, M.C.

Book ID: 121449991
Publisher: Taylor and Francis Group
Year: 1985
Tongue: English
Weight: 203 KB
Volume: 17
Category: Article
ISSN: 0020-7160
DOI: 10.1080/00207168508803468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lexicographic enumeration, ranking and u

Lexicographic enumeration, ranking and unranking of permutations of r out of n objects

✍ Er, M. C. 📂 Article 📅 1987 🏛 Taylor and Francis Group 🌐 English ⚖ 176 KB

Ranking and unranking of B-trees

✍ U.I Gupta; D.T Lee; C.K Wong 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Ranking and Unranking of AVL-Trees

✍ Li, Liwu 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 987 KB

Ranking and Unranking of 2-3 Trees

✍ Gupta, Udai; Lee, D. T.; Wong, C. K. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 845 KB

Unranking and ranking spanning trees of

Unranking and ranking spanning trees of a graph

✍ Charles J Colbourn; Robert P.J Day; Louis D Nel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 845 KB

Ranking and unranking of non-regular tre

Ranking and unranking of non-regular trees with a prescribed branching sequence

✍ Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Ordered trees are called non-regular trees with a prescribed branching sequence (or nonregular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular tree