The minimum broadcast time problem for several processor networks
type: Item
instance of: scholarly article
title: The minimum broadcast time problem for several processor networks
zbMATH Open document ID: 0873.68009
DOI: 10.1016/0304-3975(94)00230-G
author: Klaus Jansen
author: Haiko Müller
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 985004
zbMATH Keywords: broadcasting
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
cites work: Broadcasting in Bounded Degree Graphs
cites work: Q3827949
cites work: Q4694740
cites work: Minimal broadcast networks
cites work: Q3864434
cites work: Broadcasting in Trees with Multiple Originators
cites work: Q4198056
cites work: Tight Bounds on Mimimum Broadcast Networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Gossiping in Minimal Time
cites work: Planar Formulae and Their Uses
cites work: Broadcast Networks of Bounded Degree
cites work: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: Information Dissemination in Trees
cites work: A simplified NP-complete satisfiability problem
full work available at URL: 0304-3975(94)00230-g
OpenAlex ID: W1992175439
description: scientific article; zbMATH DE number 985004