Broadcasting in butterfly and debruijn networks

DOI10.1007/3-540-55210-3_196zbMath1494.68020OpenAlexW1779312057MaRDI QIDQ5096794

Ralf Klasing, Regine Peine, Burkhard Monien, Elena A. Stöhr

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_196

zbMATH Keywords

butterfly networkbroadcastingde Bruijn network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Note on optimal gossiping in some weak-connected graphs ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasting in the butterfly network
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Methods and problems of communication in usual networks
• Group Action Graphs and Parallel Architectures
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A group-theoretic model for symmetric interconnection networks
• Broadcasting in Bounded Degree Graphs
• Compressing cube-connected cycles and butterfly networks
• An Adaptation of the Fast Fourier Transform for Parallel Processing

This page was built for publication: Broadcasting in butterfly and debruijn networks