Author:
Su Zhixiong,Qi Jianxun,Wei Hanying
Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Control and Systems Engineering
Reference24 articles.
1. Al Nasr, K., Ranjan, D., Zubair, M., Chen, L. & He, J. (2014). Solving the secondary structure matching problem in CryoEM De Novo modeling using a constrained k-shortest path graph algorithm. Computational Biology and Bioinformatics, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 11(2): 419–430.
2. András, B. & Péter, K. (1977). Determining the kth shortest path by the matrix method. Szigma–Mat.-Közgazdasági Folyóirat, 10 (1–2): 61–67.
3. Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2013). Kernel bounds for path and cycle problems. Theoretical Computer Science, 511: 117–136.
4. Chen, Y.L. & Tang, W. (2005). Finding the Kth shortest path in a time-scheduling network. Naval Research Logistics, 52: 93–102.
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L. & Stein, C. (2009). Introduction to Algorithms (3rd edition). The MIT Press, Cambridge.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A mapreduce-based approach for shortest path problem in road networks;Journal of Ambient Intelligence and Humanized Computing;2018-02-06