Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A study of minimum gossip graphs

From MaRDI portal
Publication:1974518
Jump to:navigation, search

DOI10.1016/S0012-365X(99)00227-7zbMath0983.94002MaRDI QIDQ1974518

Guillaume Fertin

Publication date: 7 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

networksgossipinginformation disseminationcommunication problemsminimum gossip graphs


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication theory (94A05)


Related Items (5)

The epistemic gossip problem ⋮ A survey on Knödel graphs. ⋮ Unnamed Item ⋮ Minimum broadcast tree decompositions ⋮ Hierarchical broadcast and gossip networks







This page was built for publication: A study of minimum gossip graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1974518&oldid=14428226"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki