کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395081 | 665927 | 2010 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constructing edge-disjoint spanning trees in twisted cubes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The use of edge-disjoint spanning trees or independent spanning trees in a network for data broadcasting has the benefits of increased of bandwidth and fault-tolerance. In this paper, we propose an algorithm which constructs n edge-disjoint spanning trees in the n-dimensional twisted cube, denoted by TQn. Because the n-dimensional twisted cube is n -regular, the result is optimal with respect to the number of edge-disjoint spanning trees constructed. Furthermore, we also show that n2 of the n edge-disjoint spanning trees constructed are independent spanning trees. This algorithm runs in time O(N log N) and can be parallelized to run in time O(log N) where N is the number of nodes in TQn.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 180, Issue 20, 15 October 2010, Pages 4075–4083
Journal: Information Sciences - Volume 180, Issue 20, 15 October 2010, Pages 4075–4083
نویسندگان
Ming-Chien Yang,