Metabolic reconstruction using shortest paths, Simulation Practice and Theory, vol.8, pp.109-125, 2000. ,
Language models for a spelled letter recognizer, 1995 International Conference on Acoustics, Speech, and Signal Processing, vol.1, pp.856-859, 1995. ,
Computing the n best loopless paths in a network, Journal of the Society for Industrial and Applied Mathematics, vol.11, pp.1096-1102, 1963. ,
, , 2006.
Finding the k shortest paths, SIAM Journal on Computing, vol.28, pp.652-673, 1998. ,
, , 2014.
Finding k shortest simple paths in directed graphs: A node classification algorithm, Networks, vol.64, pp.6-17, 2014. ,
The pairing heap: A new form of self-adjusting heap, Algorithmica, vol.1, pp.111-129, 1986. ,
Fully dynamic algorithms for maintaining shortest paths trees, J. of Algorithms, vol.34, pp.251-281, 2000. ,
An efficient implementation of an algorithm for finding k shortest simple paths, An International Journal, vol.34, pp.88-101, 1999. ,
Finding the k shortest simple paths: A new algorithm and its implementation, ACM Transactions on Algorithms (TALG), vol.3, p.45, 2007. ,
Finding the k shortest paths in a time-schedule network with constraints on arcs, Computers & operations research, vol.40, pp.2975-2982, 2013. ,
An efficient algorithm for k shortest simple paths, Networks, vol.12, pp.411-427, 1982. ,
k-best enumeration -theory and application. Theses, 2018. ,
A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph, Int. Symp. on Algorithms and Computation (ISAAC) (2016), vol.64, pp.1-49 ,
New flexible approaches for multiple sequence alignment, Journal of Computational Biology, vol.4, pp.385-413, 1997. ,
, The Sage Developers. SageMath, the Sage Mathematics Software System (Version 8.9, 2019.
Finding the k shortest paths in a schedule-based transit network, Computers & Operations Research, vol.39, pp.1812-1826, 2012. ,
Finding the k shortest loopless paths in a network, Management Science, vol.17, pp.712-716, 1971. ,