"Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected ..."

Teofilo F. Gonzalez, David Serena (2002)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2006-09-26

- no documents available
- export record
  dblp key:
  - conf/pdcs/GonzalezS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdcs/GonzalezS02
Teofilo F. Gonzalez, David Serena:
Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS 2002: 61-66

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.