Multicasting in the hypercube, chord and binomial graphs

DOI10.1016/J.IPL.2010.06.009zbMATH Open1234.68019OpenAlexW2092809172MaRDI QIDQ407543FDOQ407543

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

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

zbMATH Keywords

NP-complete\(n\)-cubeSteiner treeschordbinomial graphsmulticasting

Mathematics Subject Classification ID

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

Cites Work

• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pairwise edge disjoint shortest paths in the \(n\)-cube

Cited In (2)

• Title not available (Why is that?)
• 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)