Broadcasting from multiple originators
type: Item
instance of: scholarly article
title: Broadcasting from multiple originators
zbMATH Open document ID: 1209.94025
author: Arthur L. Liestman
author: Ladislav Stacho
author: Dana Richards
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5702603
zbMATH Keywords: broadcast
zbMATH Keywords: multiple originator
zbMATH Keywords: minimum broadcast graph
zbMATH Keywords: relaxed broadcast
MaRDI profile type: Publication
full work available at URL: j.dam.2009.02.013
OpenAlex ID: W2024633871
cites work: Q4198056
cites work: The multiple originator broadcasting problem in graphs
cites work: Information Dissemination in Trees
cites work: Minimum broadcast graphs
cites work: Antepenultimate broadcasting
cites work: Sparse broadcast graphs
cites work: Compound constructions of broadcast networks
cites work: On the construction of minimal broadcast networks
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: More broadcast graphs
cites work: A new method for constructing minimal broadcast networks
cites work: Lower bounds for the size in four families of minimum broadcast graphs
cites work: On the monotonicity of the broadcast function
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Methods and problems of communication in usual networks
cites work: Q4870160
cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
cites work: Minimal broadcast networks
cites work: Fault-tolerant broadcast graphs
cites work: Broadcasting in Trees with Multiple Originators
cites work: Minimum multiple originator broadcast graphs
DOI: 10.1016/J.DAM.2009.02.013
description: scientific article; zbMATH DE number 5702603