The complexity of the characterization of networks supporting shortest-path interval routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks. The complexity of the characterization of networks supporting shortest-path interval routing. Theoretical Computer Science, 289(1):85-104, 2002.

Authors

Tamar Eilam

This author has not been identified. Look up 'Tamar Eilam' in Google

Shlomo Moran

This author has not been identified. Look up 'Shlomo Moran' in Google

Shmuel Zaks

This author has not been identified. Look up 'Shmuel Zaks' in Google