Efficient broadcasting in an arrangement graph using multiple spanning trees

MaRDI QIDQ2760286zbMATH OpenFDO

Authors Yuh-Shyan Chen, En-Huai Tseng, Tong-Ying Juang

Publication date 27 June 2002

zbMATH Keywords

arrangement graphbroadcasting algorithmspanning treesstar graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• Fault-Tolerant Broadcasting on the Arrangement Graph
• Arrangement graphs: A class of generalized star graphs
• On the arrangement graph.

Cited in

(8)

• Efficient group coordination in multicast trees
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• An Efficient Vertex Addition Method for Broadcast Networks
• Fault-Tolerant Broadcasting on the Arrangement Graph
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• scientific article; zbMATH DE number 6843211 (Why is no real title available?)
• A broadcasting algorithm on the arrangement graph
• An efficient algorithm for multiple simultaneous broadcasts in the hypercube

This page was built for publication: Efficient broadcasting in an arrangement graph using multiple spanning trees

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