Yen's algorithm

Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
01219732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We present an algorithm for the k shortest simple path problem on weighted directed graphs (kSSP) that is based on Eppstein’s… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2014
2014
Finding shortest simple paths in a directed graph is a fundamental problem in many engineering applications. Most existing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We present a routing scheme for MPLS networks with probabilistic failures. Our routing scheme simultaneously maximizes the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
We address the problem identifying the K best point-to-point simple paths connecting a given pair of nodes in a directed network… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
Analysis of opportunities and approaches to parallel implementation of the Yen's algorithm is done and the expediency of such… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table I
Is this relevant?
2011
2011
Multipath traffic engineering has been studied to disperse traffic flows on an IP network and guarantee end-to-end quality of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Yen's algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this… (More)
Is this relevant?
1996
1996
We introduce a linear time-varying (LTV) system framework for the modeling and design of linear algorithms for interpolating band… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1975
1975
The paper contains results of computational experiences with the following algorithms for finding the transitive closure of a… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1973
1973
An error in Yen's algorithm is pointed out, and an alternative is offered which will produce correct results. 
  • figure 1
Is this relevant?