Some minimum gossip graphs

DOI10.1002/net.3230230416zbMath0795.90023OpenAlexW2037376839MaRDI QIDQ5289378

Roger Labahn

Publication date: 23 August 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230416

zbMATH Keywords

gossipingminimum number of edgesbidirectional telephone calls

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (10)

Hierarchical broadcast networks ⋮ Methods and problems of communication in usual networks ⋮ Unnamed Item ⋮ Oriented hypercubes ⋮ Kernels of minimum size gossip schemes ⋮ The epistemic gossip problem ⋮ A survey on Knödel graphs. ⋮ Unnamed Item ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Compound constructions of broadcast networks

Cites Work

• Unnamed Item

This page was built for publication: Some minimum gossip graphs