Multicasting in the hypercube, chord and binomial graphs

DOI10.1016/j.ipl.2010.06.009zbMath1234.68019OpenAlexW2092809172MaRDI QIDQ407543

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

NP-completeSteiner treesmulticastingchord\(n\)-cubebinomial graphs

Mathematics Subject Classification ID

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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