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

Bounded-call broadcasting

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

DOI10.1016/0166-218X(94)90178-3zbMath0807.94036WikidataQ126470810 ScholiaQ126470810MaRDI QIDQ1339878

Arthur M. Farley, Andrzej Proskurowski

Publication date: 5 March 1995

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


zbMATH Keywords

broadcastingbroadcast protocolbroadcast graphs


Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)


Related Items

Binary linear programming models for robust broadcasting in communication networks, Methods and problems of communication in usual networks, An algorithm for constructing minimalc-broadcast networks



Cites Work

  • Sparse broadcast graphs
  • Minimum broadcast graphs
  • Broadcast Networks of Bounded Degree
  • On the construction of minimal broadcast networks
  • Minimal broadcast networks
  • Information Dissemination in Trees
  • Broadcasting in Bounded Degree Graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1339878&oldid=13473637"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki