"Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes ..."

Cheng-Nan Lai (2012)

> Home

Details and statistics

DOI: 10.1109/TPDS.2011.261

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  authority control:
- export record
  dblp key:
  - journals/tpds/Lai12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/Lai12
Cheng-Nan Lai:
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications. IEEE Trans. Parallel Distributed Syst. 23(6): 1129-1134 (2012)

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.