Routing permutations and 2-1 routing requests in the hypercube

DOI10.1016/S0166-218X(00)00386-3zbMath0983.68018OpenAlexW2026291005MaRDI QIDQ5948960

Olivier Baudon, Ivan M. Havel, Guillaume Fertin

Publication date: 28 April 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00386-3

zbMATH Keywords

directed symmetric \(n\)-dimensional hypercubeSzymanski's conjecture

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (2)

Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem ⋮ 2-1 routing requests in the hypercube

Cites Work

• Unnamed Item
• Counterexample to a conjecture of Szymanski on hypercube routing
• Rearrangeable circuit-switched hypercube architectures for routing permutations
• Routings for involutions of a hypercube
• Routing a permutation in the hypercube by two sets of edge disjoint paths

This page was built for publication: Routing permutations and 2-1 routing requests in the hypercube