"Node-disjoint paths in k-ary n-cube with optimal maximum path length."

Yuanhang Xu et al. (2025)

> Home

Details and statistics

DOI: 10.1007/S11227-025-07454-W

access: closed

type: Journal Article

metadata version: 2025-06-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/XuWFCH25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/XuWFCH25
Yuanhang Xu, Yan Wang, Jianxi Fan, Baolei Cheng, Qi He:
Node-disjoint paths in k-ary n-cube with optimal maximum path length. J. Supercomput. 81(8): 1013 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.