Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Finding All Hops k-Shortest Paths
Gang Cheng,
Nirwan Ansari
Electrical and Computer Engineering
Research output
:
Contribution to conference
›
Paper
›
peer-review
7
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding All Hops k-Shortest Paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
K-shortest Paths
100%
Computational Complexity
50%
Bellman-Ford
50%
Comparison-based
50%
Bellman-Ford Algorithm
25%
Optimal Path Problem
25%
K Shortest Path Problem
25%
Computer Science
Computational Complexity
100%
Bellman-Ford Algorithm
50%
Shortest Path Problem
50%