A compounding algorithm for 1-fault tolerant broadcast networks

Brian Q. Rieksts, José A. Ventura

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


This theoretical paper presents a new construction algorithm for sparse 1-fault tolerant minimal broadcast networks (1-FTMBNs). To construct a large 1-FTMBN with the algorithm, identical nodes in copies of a broadcast network that is not fault tolerant are connected according to the edge structures of two known 1-FTMBNs with a special property. In most cases, computational results with this algorithm produce the bestknown bounds on the cardinalities of the edge sets of the sparsest 1-FTMBNs with an odd number of nodes.

Original languageEnglish (US)
Pages (from-to)687-713
Number of pages27
JournalAsia-Pacific Journal of Operational Research
Issue number5
StatePublished - Oct 2007

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research


Dive into the research topics of 'A compounding algorithm for 1-fault tolerant broadcast networks'. Together they form a unique fingerprint.

Cite this