Optimal algorithms for dissemination of information in some interconnection networks
type: Item
instance of: scholarly article
title: Optimal algorithms for dissemination of information in some interconnection networks
zbMATH Open document ID: 0773.68007
DOI: 10.1007/BF01908630
author: Juraj Hromkovič
author: Claus-Dieter Jeschke
author: Burkhard Monien
published in: Algorithmica
publication date: 1993-09-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 404616
zbMATH Keywords: gossiping
zbMATH Keywords: broadcasting
zbMATH Keywords: one-way communication
zbMATH Keywords: lower bound
zbMATH Keywords: interconnection networks
MaRDI profile type: Publication
cites work: Parallel algorithms for gossiping by mail
cites work: Gossips and telephones
cites work: Gossips and telegraphs
cites work: Q3886878
cites work: A survey of gossiping and broadcasting in communication networks
cites work: A Cure for the Telephone Disease
cites work: Broadcast Networks of Bounded Degree
cites work: Generalizations of broadcasting and gossiping
cites work: Broadcasting in the butterfly network
full work available at URL: https://doi.org/10.1007/bf01908630
OpenAlex ID: W2088523482
description: scientific article; zbMATH DE number 404616