scientific article; zbMATH DE number 841662

zbMATH Open0846.94027MaRDI QIDQ4863516FDOQ4863516

Authors: James Knisely, Renu C. Laskar 

Publication date: 6 February 1996

Title of this publication is not available (Why is that?)

Recommendations

• A new method for constructing minimal broadcast networks
• Efficient construction of broadcast graphs
• Some minimum broadcast graphs
• Lower bounds for the size in four families of minimum broadcast graphs
• Minimum \(k\)-broadcast graphs

zbMATH Keywords

cyclic gossiping timeminimal cyclic broadcast graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Cited In (2)

• Minimum \(k\)-broadcast graphs
• Minimal configuration bicyclic graphs

This page was built for publication:

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