A broadcasting algorithm with time and message optimum on arrangement graphs.

Bai, Leqiang, et al. "A broadcasting algorithm with time and message optimum on arrangement graphs.." Journal of Graph Algorithms and Applications 2 (1998): Paper No. 2, 17 p.-Paper No. 2, 17 p.. <http://eudml.org/doc/47959>.

@article{Bai1998,
author = {Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo},
journal = {Journal of Graph Algorithms and Applications},
keywords = {distribution broadcasting algorithm; optimal time complexity},
language = {eng},
pages = {Paper No. 2, 17 p.-Paper No. 2, 17 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {A broadcasting algorithm with time and message optimum on arrangement graphs.},
url = {http://eudml.org/doc/47959},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Bai, Leqiang
AU - Maeda, Hajime
AU - Ebara, Hiroyuki
AU - Nakano, Hideo
TI - A broadcasting algorithm with time and message optimum on arrangement graphs.
JO - Journal of Graph Algorithms and Applications
PY - 1998
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 2
SP - Paper No. 2, 17 p.
EP - Paper No. 2, 17 p.
LA - eng
KW - distribution broadcasting algorithm; optimal time complexity
UR - http://eudml.org/doc/47959
ER -