Finding All Hops Shortest Paths

Gang Cheng, Nirwan Ansari

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)122-124
Number of pages3
JournalIEEE Communications Letters
Issue number2
StatePublished - Feb 2004

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


  • Quality of service (QoS)
  • Routing


Dive into the research topics of 'Finding All Hops Shortest Paths'. Together they form a unique fingerprint.

Cite this