Broadcast Networks of Bounded Degree

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1988 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Discrete Mathematics, volume 1, pages 531-540 (issn: 0895-4801, eissn: 1095-7146,

Copyright policy )

Authors: Liestman, Arthur L.; Peters, Joseph G.;

doi: 10.1137/0401049

Broadcast Networks of Bounded Degree

- Summary
- Subjects
- Metrics

Abstract

Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all 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) in which this process can be completed in minimum time from any originator. The graphs produced by these methods contain high degree vertices. This paper describes graphs with fixed maximum degree in which broadcasting can be completed in near minimum time.

Keywords

Theory of software, Applications of graph theory to circuits and networks, Broadcasting, bounded degree, cube-connected cycles, shuffle-exchange networks, sparse graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	42
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average