"An efficient construction of one-to-many node-disjoint paths in folded ..."

Cheng-Nan Lai (2014)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2013.12.005

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/Lai14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/Lai14
Cheng-Nan Lai:
An efficient construction of one-to-many node-disjoint paths in folded hypercubes. J. Parallel Distributed Comput. 74(4): 2310-2316 (2014)

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.