"The Complexity of Characterization of Networks Supporting Shortest-Path ..."

Tamar Eilam, Shlomo Moran, Shmuel Zaks (1997)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2004-01-30

- no documents available
- export record
  dblp key:
  - conf/sirocco/EilamMZ97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/EilamMZ97
Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111

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.