Broadcast Networks of Bounded Degree

DOI10.1137/0401049zbMath0662.94027OpenAlexW2068738660MaRDI QIDQ3813762

Arthur L. Liestman, Joseph G. Peters

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401049

zbMATH Keywords

sparse graphscube-connected cyclesbounded degreeBroadcastingshuffle-exchange networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (18)

Binary linear programming models for robust broadcasting in communication networks ⋮ Bounded-call broadcasting ⋮ Methods and problems of communication in usual networks ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Broadcasting in butterfly and debruijn networks ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Data transmission in processor networks ⋮ Broadcasting in the butterfly network ⋮ The minimum broadcast time problem for several processor networks ⋮ Sparse broadcast graphs ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Lower bounds on systolic gossip ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ On the construction of regular minimal broadcast digraphs ⋮ Graph theoretical issues in computer networks

This page was built for publication: Broadcast Networks of Bounded Degree