A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

DOI10.7155/JGAA.00005MaRDI QIDQ4397213zbMATH OpenOpenAlexFDO

Authors Leqiang Bai, Hajime Maeda, Hiroyuki Ebara, Hideo Nakano

Publication date 5 July 1998

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/47959

zbMATH Keywords

distribution broadcasting algorithmoptimal time complexity

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Fault-Tolerant Broadcasting on the Arrangement Graph
• Efficient broadcasting in an arrangement graph using multiple spanning trees
• scientific article; zbMATH DE number 1156592
• An optimal algorithm for broadcasting multiple messages in trees

Cited in

(11)

• One-to-all broadcast algorithm for constant degree 4 Cayley graphs
• Efficient broadcasting in an arrangement graph using multiple spanning trees
• Maximal vertex-connectivity of
• scientific article; zbMATH DE number 5139470 (Why is no real title available?)
• Fault-Tolerant Broadcasting on the Arrangement Graph
• scientific article; zbMATH DE number 913351 (Why is no real title available?)
• Linearly many faults in arrangement graphs
• scientific article; zbMATH DE number 2230273 (Why is no real title available?)
• A broadcasting algorithm on the arrangement graph
• Approximation algorithms in graphs with known broadcast time of the base graph
• Conditional matching preclusion for the arrangement graphs

This page was built for publication: A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

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