Login / Signup

Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.

Qian-Ping GuHisao Tamaki
Published in: IPPS (1996)
Keyphrases
  • disjoint paths
  • approximation algorithms
  • undirected graph
  • directed graph
  • network topology
  • routing problem
  • wireless ad hoc networks
  • image processing
  • special case
  • inter domain