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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Denis Kurz, Petra Mutzel
- ISAAC
- 2016

We present an algorithm for the k shortest simple path problem on weighted directed graphs (kSSP) that is based on Eppstein’s… (More)

Is this relevant?

2014

2014

- Gang Feng
- IEEE Trans. Computers
- 2014

Finding shortest simple paths in a directed graph is a fundamental problem in many engineering applications. Most existing… (More)

Is this relevant?

2013

2013

- Jorge Crichigno, Joud Khoury, Nasir Ghani
- 2013 IEEE International Conference on…
- 2013

We present a routing scheme for MPLS networks with probabilistic failures. Our routing scheme simultaneously maximizes the… (More)

Is this relevant?

2012

2012

- Antonio Sedeño-Noda
- Applied Mathematics and Computation
- 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)

Is this relevant?

2011

2011

- M. I. Tribrat, S. D. Pogorilyy, D. V. Afanas'ev
- Proceedings of the 6th IEEE International…
- 2011

Analysis of opportunities and approaches to parallel implementation of the Yen's algorithm is done and the expediency of such… (More)

Is this relevant?

2011

2011

- Hiroshi Matsuura
- 2011 13th Asia-Pacific Network Operations and…
- 2011

Multipath traffic engineering has been studied to disperse traffic flows on an IP network and guarantee end-to-end quality of… (More)

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

- Giancarlo Calvagno, David C. Munson
- Signal Processing
- 1996

We introduce a linear time-varying (LTV) system framework for the modeling and design of linear algorithms for interpolating band… (More)

Is this relevant?

1975

1975

- Maciej M. Syslo, J. Dzikiewicz
- Computing
- 1975

The paper contains results of computational experiences with the following algorithms for finding the transitive closure of a… (More)

Is this relevant?

1973

1973

- Thomas A. Williams, Gregory P. White
- J. ACM
- 1973

An error in Yen's algorithm is pointed out, and an alternative is offered which will produce correct results.

Is this relevant?