Note on the problem of gossiping in multidimensional grids
type: Item
instance of: scholarly article
title: Note on the problem of gossiping in multidimensional grids
zbMATH Open document ID: 0838.94029
DOI: 10.1016/0166-218X(94)90191-0
published in: Discrete Applied Mathematics
publication date: 1996-06-03T00:00:00Z
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 701710
zbMATH Keywords: broadcasting
zbMATH Keywords: full-duplex pairwise
zbMATH Keywords: gossip in multidimensional nontoroidal grids
author: Maryvonne Mahéo
author: Jean-François Saclé
MaRDI profile type: Publication
cites work: Q3886878
cites work: Fast Gossiping for the Hypercube
full work available at URL: 0166-218x(94)90191-0
OpenAlex ID: W2032389933
Recommended article: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
Recommended article: Optimal gossiping in square 2D meshes
Recommended article: Note on optimal gossiping in some weak-connected graphs
Recommended article: Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Recommended article: On the complexity of asynchronous gossip
Recommended article: Gossiping in vertex-disjoint paths mode in interconnection networks
Recommended article: On optimal solutions to the problem of gossiping in minimum time
Recommended article: The partial gossiping problem
description: scientific article; zbMATH DE number 701710