Broadcasting in DMA-bound bounded degree graphs

DOI10.1016/0166-218X(92)90147-3zbMath0755.94018OpenAlexW2084386434MaRDI QIDQ1199443

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

communication networksgraphsde Bruijn digraphsinformation disseminationbroadcast timeBroadcastingcompounding graphs

Mathematics Subject Classification ID

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

Related Items (11)

Binary linear programming models for robust broadcasting in communication networks ⋮ Methods and problems of communication in usual networks ⋮ Minimum \(k\)-broadcast graphs ⋮ Bounded depth broadcasting ⋮ Improved upper and lower bounds fork-broadcasting ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ An algorithm for constructing minimalc-broadcast networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ k-Broadcasting in trees ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Broadcasting in weighted trees under the postal model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast digraphs
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Minimum broadcast graphs
• Methods and problems of communication in usual networks
• Generalized Fibonacci Numbers and Associated Matrices
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• Minimal broadcast networks
• Broadcasting in Bounded Degree Graphs
• Tight Bounds on Mimimum Broadcast Networks
• Optimum broadcasting and personalized communication in hypercubes

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