Toward optimal gossiping schemes with conference calls
type: Item
instance of: scholarly article
title: Toward optimal gossiping schemes with conference calls
zbMATH Open document ID: 0529.05043
DOI: 10.1016/0166-218X(84)90065-9
author: Arthur L. Liestman
author: Dana Richards
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 94A99
zbMATH DE Number: 3840000
zbMATH Keywords: k-person conference calls
zbMATH Keywords: gossip
zbMATH Keywords: minimum calling scheme
MaRDI profile type: Publication
cites work: Gossips and telephones
cites work: Q4200100
cites work: A Problem with Telephones
cites work: A Cure for the Telephone Disease
cites work: The communication problem on graphs
cites work: Further gossip problems
cites work: Efficient Communication by Phone Calls
cites work: Q5632576
full work available at URL: 0166-218x(84)90065-9
OpenAlex ID: W1968587703
description: scientific article; zbMATH DE number 3840000