Finding All Hops Shortest Paths

Authors

Gang Cheng, New Jersey Institute of Technology
Nirwan Ansari, New Jersey Institute of Technology

Document Type

Article

Publication Date

2-1-2004

Abstract

In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.

Identifier

1642310478 (Scopus)

Publication Title

IEEE Communications Letters

External Full Text Location

https://doi.org/10.1109/LCOMM.2004.823365

ISSN

10897798

First Page

122

Last Page

124

Issue

2

Volume

8

Fund Ref

State of New Jersey Commission on Science and Technology

Recommended Citation

Cheng, Gang and Ansari, Nirwan, "Finding All Hops Shortest Paths" (2004). Faculty Publications. 20452.
https://digitalcommons.njit.edu/fac_pubs/20452