Kernels of minimum size gossip schemes
type: Item
instance of: scholarly article
title: Kernels of minimum size gossip schemes
zbMATH Open document ID: 0844.68092
DOI: 10.1016/0012-365X(94)00031-D
author: Roger Labahn
published in: Discrete Mathematics
publication date: 1996-08-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 790548
zbMATH Keywords: gossip schemes
MaRDI profile type: Publication
cites work: A Problem with Telephones
cites work: Q4710454
cites work: A recurrence for linear extensions
cites work: Methods and problems of communication in usual networks
cites work: Label-connected graphs and the gossip problem
cites work: The communication problem on graphs
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q3964626
cites work: Further gossip problems
cites work: Q3487440
cites work: Some minimum gossip graphs
cites work: Information flows on hypergraphs
cites work: Generalizations of broadcasting and gossiping
cites work: Projective images of modular (distributive, complemented) lattices are modular (distributive, complemented)
cites work: Q3748279
cites work: A class of solutions to the gossip problem. III
cites work: Q3684157
description: scientific article; zbMATH DE number 790548