Minimum \(k\)-broadcast graphs
type: Item
instance of: scholarly article
title: Minimum \(k\)-broadcast graphs
zbMATH Open document ID: 0807.94030
DOI: 10.1016/0166-218X(94)90185-6
author: Emmanuel Lazard
author: Jean-Claude König
published in: Discrete Applied Mathematics
publication date: 1994-12-11T00:00:00Z
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 701704
zbMATH Keywords: \(k\)-broadcast graph
zbMATH Keywords: broadcasting
zbMATH Keywords: communication network
MaRDI profile type: Publication
cites work: Sparse broadcast graphs
cites work: Q3474496
cites work: Minimal broadcast networks
cites work: Minimum broadcast graphs
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4198056
cites work: Broadcasting in DMA-bound bounded degree graphs
cites work: Minimum broadcast digraphs
cites work: Q3895500
cites work: Some minimum broadcast graphs
full work available at URL: 0166-218x(94)90185-6
OpenAlex ID: W2075209307
Recommended article: Some minimum broadcast graphs
Recommended article: Q4529448
Recommended article: Minimum broadcast digraphs
Recommended article: On the structure of minimum broadcast digraphs
Recommended article: Q4863516
Recommended article: Tight Bounds on Mimimum Broadcast Networks
Recommended article: Minimum multiple originator broadcast graphs
Recommended article: Minimum multiple message broadcast graphs
Recommended article: An algorithm for constructing minimal \(c\)-broadcast networks
Recommended article: A minimum broadcast graph on 26 vertices
description: scientific article; zbMATH DE number 701704