Set-to-Set Disjoint Paths Problem in Möbius Cubes
The set-to-set disjoint paths problem is to find <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> vertex-disjoint paths <inline-formula> <tex-math notation="LaTeX">${ \boldsymbol s}_{i}\leadsto { \boldsymbol t}_{j_{i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9852209/ |