The partial gossiping problem
type: Item
instance of: scholarly article
title: The partial gossiping problem
zbMATH Open document ID: 0841.90063
DOI: 10.1016/0012-365X(94)00257-J
author: Yuh-Jiuan Tsay
author: Gerard Jennhwa Chang
published in: Discrete Mathematics
publication date: 1996-03-24T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 858073
zbMATH Keywords: broadcasting
zbMATH Keywords: gossiping
zbMATH Keywords: minimum number of calls
MaRDI profile type: Publication
cites work: Gossips and telephones
cites work: The gossip problem
cites work: A Problem with Telephones
cites work: Q4132560
cites work: The complexity of comparability graph recognition and coloring
cites work: A Cure for the Telephone Disease
cites work: The communication problem on graphs
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Further gossip problems
cites work: New gossips and telephones
cites work: Generalizations of broadcasting and gossiping
cites work: Q5632576
Recommended article: The exact gossiping problem
Recommended article: Q4457548
Recommended article: On optimal solutions to the problem of gossiping in minimum time
Recommended article: A class of solutions to the gossip problem. III
Recommended article: Q4826177
Recommended article: On generalized gossiping and broadcasting
Recommended article: Optimal odd gossiping
Recommended article: On the complexity of asynchronous gossip
Recommended article: The Worst Case Behavior of Randomized Gossip
Recommended article: Optimal gossiping in paths and cycles
description: scientific article; zbMATH DE number 858073