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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.