Counterexample to a conjecture of Szymanski on hypercube routing
From MaRDI portal
Publication:911780
DOI10.1016/0020-0190(90)90106-8zbMath0697.68064OpenAlexW2032899692WikidataQ123272515 ScholiaQ123272515MaRDI QIDQ911780
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90106-8
Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)
Related Items (7)
Pairwise edge disjoint shortest paths in the \(n\)-cube ⋮ Monotonicity testing and shortest-path routing on the cube ⋮ Multicolor routing in the undirected hypercube ⋮ A \(d\)-move local permutation routing for the \(d\)-cube ⋮ An invariant extension method for system area networks of multicore computational systems. An ideal system network ⋮ Routing permutations and 2-1 routing requests in the hypercube ⋮ Optimal permutation routing for low-dimensional hypercubes
Cites Work
This page was built for publication: Counterexample to a conjecture of Szymanski on hypercube routing
