Compound constructions of broadcast networks
type: Item
instance of: scholarly article
title: Compound constructions of broadcast networks
zbMATH Open document ID: 0941.90009
DOI: 10.1016/S0166-218X(99)00043-8
author: Michael J. Dinneen
author: Mark C. Wilson
author: Golbon Zakeri
author: Jose A. Ventura
published in: Discrete Applied Mathematics
publication date: 1999-08-02T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 1319812
zbMATH Keywords: broadcasting
zbMATH Keywords: communication network
zbMATH Keywords: minimum broadcast graph
zbMATH Keywords: graph compound
MaRDI profile type: Publication
cites work: Antepenultimate broadcasting
cites work: Sparse broadcast graphs
cites work: Broadcasting in Bounded Degree Graphs
cites work: Q3474496
cites work: Q4038748
cites work: Minimal broadcast networks
cites work: Minimum broadcast graphs
cites work: Methods and problems of communication in usual networks
cites work: On the construction of minimal broadcast networks
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4870160
cites work: A minimum broadcast graph on 63 vertices
cites work: Some minimum gossip graphs
cites work: Some minimum broadcast graphs
cites work: Q3895500
cites work: Fault-tolerant broadcasting and gossiping in communication networks
cites work: Lower bounds for the size in four families of minimum broadcast graphs
cites work: Information Dissemination in Trees
cites work: A new method for constructing minimal broadcast networks
full work available at URL: s0166-218x(99)00043-8
OpenAlex ID: W2049528772
description: scientific article; zbMATH DE number 1319812