کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395798 | 666017 | 2009 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On embedding subclasses of height-balanced trees in hypercubes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On embedding subclasses of height-balanced trees in hypercubes On embedding subclasses of height-balanced trees in hypercubes](/preview/png/395798.png)
چکیده انگلیسی
A height-balanced tree is a rooted binary tree T in which for every vertex v∈V(T)v∈V(T), the heights of the subtrees, rooted at the left and right child of v, differ by at most one; this difference is called the balance factor of v. These trees are extensively used as data structures for sorting and searching. We embed several subclasses of height-balanced trees of height h in Qh+1Qh+1 under certain conditions. In particular, if a tree T is such that the balance factor of every vertex in the first three levels is arbitrary (0 or 1) and the balance factor of every other vertex is zero, then we prove that T is embeddable in its optimal hypercube with dilation 1 or 2 according to whether it is balanced or not.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 179, Issue 9, 15 April 2009, Pages 1333–1347
Journal: Information Sciences - Volume 179, Issue 9, 15 April 2009, Pages 1333–1347
نویسندگان
S.A. Choudum, R. Indhumathi,