Multicasting in the hypercube, chord and binomial graphs

DOI10.1016/J.IPL.2010.06.009MaRDI QIDQ407543zbMATH OpenOpenAlexFDO

Authors Christopher C. Cipriano, Teofilo F. Gonzalez

Publication date 27 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.06.009

zbMATH Keywords

\(n\)-cubebinomial graphschordmulticastingNP-completeSteiner trees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Multicast algorithms for hypercube multiprocessors
• A message-routing strategy for multicomputer systems
• scientific article; zbMATH DE number 139789
• An efficient algorithm for multiple simultaneous broadcasts in the hypercube
• scientific article; zbMATH DE number 867692

Cites work

• scientific article; zbMATH DE number 139789 (Why is no real title available?)
• scientific article; zbMATH DE number 6469145 (Why is no real title available?)
• Pairwise edge disjoint shortest paths in the \(n\)-cube
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time

Cited in

(2)

• scientific article; zbMATH DE number 139789 (Why is no real title available?)
• Multicast algorithms for hypercube multiprocessors

This page was built for publication: Multicasting in the hypercube, chord and binomial graphs

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