scientific article; zbMATH DE number 177869

MaRDI QIDQ4038748zbMATH OpenFDO

Authors Michael J. Dinneen, Michael R. Fellows, Vance Faber

Publication date 18 May 1993

Full work available at URL https://arxiv.org/abs/math/9504212

zbMATH Keywords

broadcast diameterbroadcast networksCayley graph techniquesdihedral groupshypercubesmaximum node degree

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Degree- and time-constrained broadcast networks
• New results for the degree/diameter problem
• scientific article; zbMATH DE number 4102999
• scientific article; zbMATH DE number 1107739
• On the construction of regular minimal broadcast digraphs

Cited in

(31)

• An approximation algorithm and dynamic programming for reduction in heterogeneous environments
• Sparse broadcast graphs
• One-to-all broadcast algorithm for constant degree 4 Cayley graphs
• Compound constructions of broadcast networks
• Graph theoretical issues in computer networks
• Reliable broadcasting
• A minimum broadcast graph on 63 vertices
• Time-relaxed broadcasting in communication networks
• A survey on Knödel graphs.
• Sparse hypercube -- a minimal \(k\)-line broadcast graph.
• Lower bounds for the size in four families of minimum broadcast graphs
• Bounded depth broadcasting
• More broadcast graphs
• The shortest path problem in the Knödel graph
• A new construction of broadcast graphs
• Efficient construction of broadcast graphs
• Diametral broadcast graphs
• A new construction of broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
• Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori
• Riemannian geometry of bicovariant group lattices
• Some minimum gossip graphs
• Minimum multiple message broadcast graphs
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• On broadcast schemes of Knödel graphs
• Bounds on broadcast time in well-connected graphs
• The vertex local antimagicness for Knödel and Fibonacci graphs
• Broadcast schemes of hypercubes
• All sequential dimensional broadcast schemes in Knödel 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 Q4038748)