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.
@article{EilamMZ02,
title = {The complexity of the characterization of networks supporting shortest-path interval routing},
author = {Tamar Eilam and Shlomo Moran and Shmuel Zaks},
year = {2002},
tags = {routing},
researchr = {https://researchr.org/publication/EilamMZ02},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {289},
number = {1},
pages = {85-104},
}