Multicasting in the hypercube, chord and binomial graphs

Authors:
Christopher C. Cipriano;Teofilo F. Gonzalez
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA 93106, United States;Department of Computer Science, University of California, Santa Barbara, CA 93106, United States
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

On Complexity of a Message-Routing Strategy for Multicomputer Systems

WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal routing in Chord

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pairwise edge disjoint shortest paths in the n-cube

Theoretical Computer Science
Optimal Routing in Binomial Graph Networks

PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies

Quantified Score

Hi-index	0.89

Visualization

Abstract

We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the sp-multicast (shortest path) and Steiner tree problems for the n-cube, Chord and the BNG network are NP-Complete, even when every destination vertex is at a distance two from the source vertex.