Pairwise edge disjoint shortest paths in the n-cube

Authors:
Teofilo F. Gonzalez;David Serena
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
Theoretical Computer Science
Year:
2006

Citing 5
Cited 1

Counterexample to a conjecture of Szymanski on hypercube routing

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Disjoint Paths in the Hypercube

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Parallel Computing
Complexity of pairwise shortest path routing in the grid

Theoretical Computer Science

Multicasting in the hypercube, chord and binomial graphs

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem. An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is NP-complete.