scientific article; zbMATH DE number 1420909

MaRDI QIDQ4944978zbMATH OpenFDO

Authors Olivier Baudon, Guillaume Fertin, Ivan Havel

Publication date 27 December 2000

zbMATH Keywords

hypercubeSzymanski's conjecture\((2-1)\)-routing requestrouting permutation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Routing permutations and 2-1 routing requests in the hypercube
• 2-1 routing requests in the hypercube
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Symmetric routings of the hypercube
• Some permutation routing algorithms for low-dimensional hypercubes

Cited in

(15)

• Routing permutations and 2-1 routing requests in the hypercube
• 2-1 routing requests in the hypercube
• Rearrangeable graphs
• Oblivious routing for LC permutations on hypercubes.
• Routing sets in the integer lattice
• Extremal permutations in routing cycles
• Routing properties of supercubes
• Symmetric routings of the hypercube
• Routing permutations on graphs via factors
• Counterexample to a conjecture of Szymanski on hypercube routing
• Routing multiple paths in hypercubes
• scientific article; zbMATH DE number 5233147 (Why is no real title available?)
• Multicolor routing in the undirected hypercube
• Routing linear permutations on Fibonacci and Lucas cubes
• A d-move local permutation routing for the d-cube

This page was built for publication:

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