A broadcasting algorithm on the arrangement graph

DOI10.1007/BFB0030867MaRDI QIDQ6085742zbMATH OpenOpenAlexFDO

Authors Leqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0030867

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Fault-Tolerant Broadcasting on the Arrangement Graph
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• Efficient broadcasting in an arrangement graph using multiple spanning trees
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• A new approach for routing in arrangement graphs and its performance evaluation

Cites work

• Arrangement graphs: A class of generalized star graphs
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Optimum broadcasting and personalized communication in hypercubes

Cited in

(4)

• The complexity of broadcasting in planar and decomposable graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• Comments on broadcast algorithms for two-dimensional grids
• All-to-all broadcast problems on Cartesian product graphs

This page was built for publication: A broadcasting algorithm on the arrangement graph

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