Routing a permutation in the hypercube by two sets of edge disjoint paths

DOI10.1006/JPDC.1997.1358zbMath0888.68017OpenAlexW1990241309MaRDI QIDQ1373868

Qian-Ping Gu, Hisao Tamaki

Publication date: 17 December 1997

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/20afb9c452c4e1dce2bb7f1a022117f5cb33b3fa

zbMATH Keywords

hypercubeedge-disjoint paths

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (8)

Generalized crossed rings-multirings with a decreased degree of node ⋮ The permutation-path coloring problem on trees. ⋮ Multicolor routing in the undirected hypercube ⋮ An invariant extension method for system area networks of multicore computational systems. An ideal system network ⋮ Complexity of pairwise shortest path routing in the grid ⋮ Routing permutations and 2-1 routing requests in the hypercube ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ 2-1 routing requests in the hypercube

This page was built for publication: Routing a permutation in the hypercube by two sets of edge disjoint paths