Pairwise Disjoint Paths Routing in Tori

Pairwise Disjoint Paths Routing in Tori

The pairwise disjoint paths problem is to construct c disjoint paths s<sub>i</sub> &#x2192; d<sub>i</sub> (1 &#x2264; i &#x2264; c) between given pairs of nodes (s<sub>i</sub>, d<sub>i</sub>) (1 &#x2264; i &#x2264; c) in a graph who...

Full description

Bibliographic Details
Main Authors: Keiichi Kaneko, Son Van Nguyen, Hyunh Thi Thanh Binh
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Fault tolerant systems
multiprocessor interconnection networks
network topology
parallel processing
supercomputers
Online Access:https://ieeexplore.ieee.org/document/9234411/

Internet

https://ieeexplore.ieee.org/document/9234411/

Similar Items