Abstract
Increasingly, the design of efficient computer networks and multi-processor configurations are considered important applications of computer science. There are some constraints in network design which are usually created by economic and physical limitations. One constraint is the bounded degree, which is the limited number of connections between one node to others. Another possible constraint is a bound on the time that a message can afford to take during a “broadcast”. We present, for the first time, a set of largest-known directed networks satisfied specified bounds on node degree and broadcast time. We also presents a family of optimal (Δ, Δ+1) broadcast digraphs. That is, digraphs with a proven maximum number of nodes, having maximum degree Δ and broadcast time at most Δ+1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
