"A scalable approach for computing distance-bounded node-disjoint paths in ..."

Alejandro Arbelaez et al. (2015)

> Home

Details and statistics

DOI: 10.1109/ICTON.2015.7193474

access: closed

type: Conference or Workshop Paper

metadata version: 2022-04-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icton/ArbelaezMOO015
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icton/ArbelaezMOO015
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
A scalable approach for computing distance-bounded node-disjoint paths in optical networks. ICTON 2015: 1-4

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.