"Computing distance-bounded node-disjoint paths for all pairs of nodes - An ..."

Deepak Mehta et al. (2015)

> Home

Details and statistics

DOI: 10.1109/RNDM.2015.7324311

access: closed

type: Conference or Workshop Paper

metadata version: 2025-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mwcn/MehtaOOQ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mwcn/MehtaOOQ15
Deepak Mehta, Barry O'Sullivan, Cemalletin Ozturk, Luis Quesada:
Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design. RNDM@WMNC 2015: 71-77

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.