Gossiping in vertex-disjoint paths mode in interconnection networks
type: Item
instance of: scholarly article
title: Gossiping in vertex-disjoint paths mode in interconnection networks
zbMATH Open document ID: 1528.68297
DOI: 10.1007/3-540-57899-4_60
author: Juraj Hromkovič
author: Ralf Klasing
author: Elena Stöhr
published in: Graph-Theoretic Concepts in Computer Science
publication date: 2024-01-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 7784169
MaRDI profile type: Publication
full work available at URL: 3-540-57899-4 60
OpenAlex ID: W1889867397
cites work: Gossips and telegraphs
cites work: Minimum-time line broadcast networks
cites work: Optimal algorithms for dissemination of information in generalized communication modes
cites work: Methods and problems of communication in usual networks
cites work: The shuffle exchange network has a Hamiltonian path
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q3359735
cites work: Q4870160
cites work: The communication problem on graphs
cites work: Gossiping in Minimal Time
cites work: Broadcasting in butterfly and debruijn networks
cites work: New gossips and telephones
cites work: Q3972008
cites work: Q3477932
cites work: Fast information sharing in a complete network
description: scientific article; zbMATH DE number 7784169