scientific article

zbMath0767.94028arXivmath/9504212MaRDI QIDQ4038748

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

Publication date: 18 May 1993

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypercubesdihedral groupsbroadcast networksbroadcast diameterCayley graph techniquesmaximum node degree

Mathematics Subject Classification ID

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

Related Items (23)

Some minimum gossip graphs ⋮ Reliable broadcasting ⋮ A minimum broadcast graph on 63 vertices ⋮ Lower bounds for the size in four families of minimum broadcast graphs ⋮ Riemannian geometry of bicovariant group lattices ⋮ Bounded depth broadcasting ⋮ A new construction of broadcast graphs ⋮ Time-relaxed broadcasting in communication networks ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ More broadcast graphs ⋮ A survey on Knödel graphs. ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ Sparse broadcast graphs ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ Minimum multiple message broadcast graphs ⋮ Compound constructions of broadcast networks ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ Graph theoretical issues in computer networks

This page was built for publication: