An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

DOI10.1109/TC.2010.76zbMath1366.90203OpenAlexW2171625696MaRDI QIDQ5280740

Bader F. AlBdaiwi, Ozgur Sinanoglu, Mehmet Hakan Karaata

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2010.76

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks

This page was built for publication: An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks