OPTIMAL BROADCASTING IN THE BACK-TO-BACK D-ARY TREES

Authors
BARTH D
Citation
D. Barth, OPTIMAL BROADCASTING IN THE BACK-TO-BACK D-ARY TREES, Information processing letters, 59(2), 1996, pp. 85-89
Citations number
8
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
59
Issue
2
Year of publication
1996
Pages
85 - 89
Database
ISI
SICI code
0020-0190(1996)59:2<85:OBITBD>2.0.ZU;2-H
Abstract
We show that, in the constant time and processor bound models (Fraigni aud and Lazard, 1994), the broadcast time in the back to back d-ary tr ee BB(d, n) (Earth, 1994) is b(BB(d, n)) = right perpendicular(d+ 3)n/ 2left perpendicular. In particular, to prove this result, we propose a n algorithm for broadcasting in BB(d, n).