Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 866663

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

zbMATH Open0841.05088MaRDI QIDQ4873682FDOQ4873682


Authors: S. Louis Hakimi, E. Schmeichel Edit this on Wikidata


Publication date: 17 April 1996



Title of this publication is not available (Why is that?)



Recommendations

  • Structural Information and Communication Complexity
  • Time efficient centralized gossiping in radio networks
  • An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
  • Asymptotically optimal gossiping in radio networks


zbMATH Keywords

NP-hardtime slotsgossiping in a radio network


Mathematics Subject Classification ID

Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25)



Cited In (4)

  • GATHERING RADIO MESSAGES IN THE PATH
  • Communication complexity of gossiping by packets
  • NP-completeness in the gossip monoid
  • Fast broadcasting and gossiping in radio networks





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873682)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4873682&oldid=19240806"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 04:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki