Broadcasting in (n,k)-Arrangement Graph Based on an Optimal Spanning Tree

Abstract

The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools for some important communication problems such as broadcasting and personalized communications. When it refers to communications, it always involves two costs. Specifically, sending… (More)
DOI: 10.1109/AMS.2007.24

Topics

2 Figures and Tables

Cite this paper

@article{Li2007BroadcastingI, title={Broadcasting in (n,k)-Arrangement Graph Based on an Optimal Spanning Tree}, author={Jingli Li and Yonghong Xiang and Manli Chen and Yongheng Zhou}, journal={First Asia International Conference on Modelling & Simulation (AMS'07)}, year={2007}, pages={193-197} }