One-to-all broadcast algorithm for constant degree 4 Cayley graphs

DOI10.1016/S0167-8191(98)00109-4MaRDI QIDQ1285687zbMATH OpenFDO

Authors Mohamed Benmaiza, Abderezak Touzene

Publication date 28 April 1999

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(98)00109-4

zbMATH Keywords

broadcasting algorithmCayley graphscommunication modelinterconnection network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Broadcasting on recursively decomposable Cayley graphs
• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
• scientific article; zbMATH DE number 177869
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

Cited in

(1)

• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks

This page was built for publication: One-to-all broadcast algorithm for constant degree 4 Cayley graphs

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