Broadcasting in DMA-bound bounded degree graphs

DOI10.1016/0166-218X(92)90147-3MaRDI QIDQ1199443zbMATH OpenOpenAlexFDO

Authors Emmanuel Lazard

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0166-218x(92)90147-3

zbMATH Keywords

broadcast timeBroadcastingcommunication networkscompounding graphsde Bruijn digraphsgraphsinformation dissemination

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Broadcasting in Bounded Degree Graphs
• scientific article; zbMATH DE number 219254
• Broadcast Networks of Bounded Degree
• Broadcasting on Random Directed Acyclic Graphs
• Broadcasting in random graphs
• Broadcasting in random graphs
• Boundary independent broadcasts in graphs
• An optimal family of directed, bounded-degree broadcast networks

Cites work

• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Broadcasting in Bounded Degree Graphs
• Broadcasting in DMA-bound bounded degree graphs
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Generalized Fibonacci Numbers and Associated Matrices
• Graph theory
• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• scientific article; zbMATH DE number 4102999 (Why is no real title available?)
• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• scientific article; zbMATH DE number 219254 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Methods and problems of communication in usual networks
• Minimal broadcast networks
• Minimum broadcast digraphs
• Minimum broadcast graphs
• Optimum broadcasting and personalized communication in hypercubes
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks

Cited in

(21)

• Broadcasting in DMA-bound bounded degree graphs
• Methods and problems of communication in usual networks
• Minimum \(k\)-broadcast graphs
• Bounded depth broadcasting
• Binary linear programming models for robust broadcasting in communication networks
• Improved upper and lower bounds for k-broadcasting
• On the optimality of general lower bounds for broadcasting and gossiping
• An algorithm for constructing minimal c-broadcast networks
• k-broadcasting in trees
• An optimal family of directed, bounded-degree broadcast networks
• Broadcast Networks of Bounded Degree
• scientific article; zbMATH DE number 4102999 (Why is no real title available?)
• Broadcasting in Bounded Degree Graphs
• scientific article; zbMATH DE number 219254 (Why is no real title available?)
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• A linear algorithm for finding the k‐broadcast center of a tree
• Broadcasting in weighted trees under the postal model
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• New upper bound on m-time-relaxed k-broadcast graphs
• Strong bounds and exact solutions to the minimum broadcast time problem
• Biased random-key genetic algorithms for the weighted minimum broadcast time problem

This page was built for publication: Broadcasting in DMA-bound bounded degree graphs

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