"An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in ..."

Qian-Ping Gu, Shietung Peng (2000)

> Home

Details and statistics

DOI: 10.1006/JPDC.2000.1632

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/GuP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/GuP00
Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60(6): 764-774 (2000)

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.