"Optimal construction of node-disjoint shortest paths in folded hypercubes."

Cheng-Nan Lai (2017)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2016.12.002

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/Lai17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/Lai17
Cheng-Nan Lai:
Optimal construction of node-disjoint shortest paths in folded hypercubes. J. Parallel Distributed Comput. 102: 37-41 (2017)

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.