Note on optimal gossiping in some weak-connected graphs
type: Item
instance of: scholarly article
title: Note on optimal gossiping in some weak-connected graphs
zbMATH Open document ID: 0824.68010
DOI: 10.1016/0304-3975(94)90049-3
author: Juraj Hromkovič
author: Claus-Dieter Jeschke
author: Burkhard Monien
published in: Theoretical Computer Science
publication date: 1995-02-09T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 710236
zbMATH Keywords: gossip problem
zbMATH Keywords: weak-connected graphs
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90049-3
OpenAlex ID: W2061095717
cites work: Parallel algorithms for gossiping by mail
cites work: Gossips and telephones
cites work: Q3827949
cites work: Gossiping in Minimal Time
cites work: Gossips and telegraphs
cites work: Q3886878
cites work: A Cure for the Telephone Disease
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Optimal algorithms for dissemination of information in some interconnection networks
cites work: Broadcasting in butterfly and debruijn networks
cites work: New gossips and telephones
cites work: Fast Gossiping for the Hypercube
cites work: Q3972008
cites work: Broadcast Networks of Bounded Degree
cites work: Generalizations of broadcasting and gossiping
cites work: Broadcasting in the butterfly network
description: scientific article; zbMATH DE number 710236