Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,921,220 papers from all fields of science
Search
Sign In
Create Free Account
K shortest path routing
The K shortest path routing algorithm is an extension algorithm of the shortest path routing algorithm in a given network. It is sometimes crucial to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Bellman–Ford algorithm
Breadth-first search
Computational linguistics
Constrained Shortest Path First
Expand
Broader (1)
Network theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
Ziming Zeng
,
Yuanyuan Zeng
2007
Corpus ID: 17401178
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the…
Expand
1992
1992
Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks
C. Hsu
,
J. Hui
1992
Corpus ID: 17434361
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing…
Expand