Pairwise Disjoint Paths Routing in Tori
The pairwise disjoint paths problem is to construct c disjoint paths s<sub>i</sub> → d<sub>i</sub> (1 ≤ i ≤ c) between given pairs of nodes (s<sub>i</sub>, d<sub>i</sub>) (1 ≤ i ≤ c) in a graph who...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9234411/ |