Sparse broadcast graphs

@article{Bermond1992SparseBG,
  title={Sparse broadcast graphs},
  author={Jean-Claude Bermond and Pavol Hell and Arthur L. Liestman and Joseph G. Peters},
  journal={Discrete Applied Mathematics},
  year={1992},
  volume={36},
  pages={97-130}
}
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to ail members of a network by placing calls over the communication lines of the network. Several previous papers have investigated ways to construct sparse graphs (networks) on n vertices in which this process can be completed in minimum time from any originator. In this paper, we describe four techniques to construct graphs of this type and show that they produce the sparsest known… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
18 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

A census of minimum broadcast graphs

  • S. Mitchell, S. Hedetniemi
  • J. Combin. Inform. Systems Sci
  • 1980

Similar Papers

Loading similar papers…