 
Summary: On Time Relaxed Broadcasting in Communication
Networks
A. Averbuch Y. Roditty B. Shoham
Department of Computer Science
School of Mathematical Sciences
Tel Aviv University
Ramat Aviv, Tel Aviv 69978
Israel
email: jr@math.tau.ac.il
Abstract
A broadcast graph on n vertices is a network in which a message can be broadcast
in the minimum possible (= dlog 2 ne) time from any vertex. Broadcast graphs having
the smallest number of edges are called Minimum Broadcast Graphs, and are subjects
of intensive study. In this paper we study how the number of edges in a minimum
broadcast graphs decrease, as we allow addition time over dlog 2 ne, until we get a tree.
We accomplish our aim by improving results obtained by ([15]). We also prove a
conjecture presented in [15, 16].
1 Introduction
Efficient broadcasting is a key component in achieving high performance (throughput) from
parallel and distributed processing.
