Routings for involutions of a hypercube
From MaRDI portal
Publication:1315464
DOI10.1016/0166-218X(92)00126-7zbMath0788.68110OpenAlexW2009860558MaRDI QIDQ1315464
Publication date: 9 June 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00126-7
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (3)
Routing permutations on a graph ⋮ Multicolor routing in the undirected hypercube ⋮ Routing permutations and 2-1 routing requests in the hypercube
Cites Work
- Unnamed Item
- Half-integral five-terminus flows
- Disjoint paths in a rectilinear grid
- Multicommodity flows in planar graphs
- Optimal Three-Layer Channel Routing
- On the routability of a convex grid
- A Self-Routing Benes Network and Parallel Permutation Algorithms
- Optimum broadcasting and personalized communication in hypercubes
This page was built for publication: Routings for involutions of a hypercube