The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
type: Item
instance of: scholarly article
title: The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
zbMATH Open document ID: 0902.68080
DOI: 10.1016/S0166-218X(97)00112-1
author: Ralf Klasing
published in: Discrete Applied Mathematics
publication date: 1998-12-10T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1180310
zbMATH Keywords: interconnection networks
zbMATH Keywords: vertex-disjoint paths
MaRDI profile type: Publication
cites work: Minimum-time line broadcast networks
cites work: Optimal algorithms for dissemination of information in generalized communication modes
cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes
cites work: New gossips and telephones
cites work: Q4002466
description: scientific article; zbMATH DE number 1180310