On the construction of regular minimal broadcast digraphs

DOI10.1016/0304-3975(92)00094-8zbMath0795.68151OpenAlexW2044166636MaRDI QIDQ1318708

Kyung-Yong Chwa, Jung-Heum Park

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)00094-8

zbMATH Keywords

communication networkcirculantminimal broadcast digraph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the structure of minimum broadcast digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum broadcast graphs
• A class of vertex-transitive digraphs
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Implementation and Analysis of Binomial Queue Algorithms

This page was built for publication: On the construction of regular minimal broadcast digraphs