کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6874789 | 688036 | 2014 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Unranking of small combinations from large sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
An unranking algorithm for a finite set S is an algorithm that, given a number in {0,1,â¦,|S|â1}, returns an element of S that is associated with the number. We suppose that a number can be associated with any element in S so long as distinct elements are associated with different numbers. A ranking algorithm is the reverse of an unranking algorithm. In this paper, we present an unranking algorithm for the set of all m-element subsets of an n-element set. Our algorithm runs with O(m3m+3) arithmetic operations, which is independent of n and hence is effective when n is large. We also show that it admits a ranking algorithm with the same running time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Discrete Algorithms - Volume 29, November 2014, Pages 8-20
Journal: Journal of Discrete Algorithms - Volume 29, November 2014, Pages 8-20
نویسندگان
Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi,