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

Extremal broadcasting problems

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

DOI10.1016/0166-218X(89)90024-3zbMath0672.94023MaRDI QIDQ1120554

Roger Labahn

Publication date: 1989

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


zbMATH Keywords

extremal broadcasting problems on graphs and on trees


Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15)


Related Items (3)

On linear-time data dissemination in dynamic rooted trees ⋮ Efficient broadcast trees for weighted vertices ⋮ k-Broadcasting in trees



Cites Work

  • Minimum broadcast graphs
  • On a unimodal sequence of binomial coefficients
  • Minimal broadcast networks
  • Broadcast Time in Communication Networks
  • Information Dissemination in Trees
  • Broadcasting in Trees with Multiple Originators
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Extremal broadcasting problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1120554&oldid=13166933"
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 02:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki