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

DOI10.1006/JPDC.1997.1358zbMATH Open0888.68017OpenAlexW1990241309MaRDI QIDQ1373868FDOQ1373868

Authors: 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

Recommendations

• Routing permutations and 2-1 routing requests in the hypercube
• Publication:4944978
• scientific article; zbMATH DE number 219253
• On Disjoint Shortest Paths Routing on the Hypercube

zbMATH Keywords

hypercubeedge-disjoint paths

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (16)

• Routing permutations and 2-1 routing requests in the hypercube
• 2-1 routing requests in the hypercube
• The generalized folding-cube network
• 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
• Embedding multidimensional grids into optimal hypercubes
• Generalized crossed rings-multirings with a decreased degree of node
• Routing permutations on graphs via factors
• Routings for involutions of a hypercube
• The permutation-path coloring problem on trees.
• Routing multiple paths in hypercubes
• From Hall's matching theorem to optimal routing on hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multicolor routing in the undirected hypercube
• A \(d\)-move local permutation routing for the \(d\)-cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373868)