{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:12:23Z","timestamp":1778562743976,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T00:00:00Z","timestamp":1408579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00500-014-1434-2","type":"journal-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T00:17:00Z","timestamp":1408493820000},"page":"2391-2402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Computing $$k$$ k shortest paths from a source node to each other node"],"prefix":"10.1007","volume":"19","author":[{"given":"Guisong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luping","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Takacs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,21]]},"reference":[{"key":"1434_CR1","doi-asserted-by":"crossref","unstructured":"Aljazzar H, Leue S (2011) K*: a heuristic search algorithm for finding the K shortest paths. Artif Intell 175:2129\u20132154","DOI":"10.1016\/j.artint.2011.07.003"},{"key":"1434_CR2","unstructured":"Aljazzar H, Leue S (2008) K*: a directed on-the-fly algorithm for finding the k shortest paths. University of Konstanz, Gemany, Tech. Rep. soft-08-03, Mar, 2008"},{"issue":"9","key":"1434_CR3","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1109\/TPAMI.2011.21","volume":"33","author":"J Berclaz","year":"2011","unstructured":"Berclaz J, Fleuret F, Turetken E et al (2011) Multiple object tracking using k-shortest paths optimization. IEEE Trans Pattern Anal Mach Intell 33(9):1806\u20131819","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1434_CR4","doi-asserted-by":"crossref","unstructured":"Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: theory and experimental evaluation. Math Program 73:129\u2013174","DOI":"10.1007\/BF02592101"},{"key":"1434_CR5","unstructured":"Demetrescu C, Goldberg A, Johnson D (2006) 9th DIMACS implementation challenge-shortest paths. American Mathematical Society"},{"issue":"2","key":"1434_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1988","unstructured":"Eppstein D (1988) Finding the k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"key":"1434_CR7","doi-asserted-by":"crossref","unstructured":"Gao J, Qiu H, Jiang X et al (2010) Fast top-k simple shortest paths discovery in graphs. Proceedings of the 19th ACM international conference on Information and knowledge management, pp 509\u2013518","DOI":"10.1145\/1871437.1871504"},{"issue":"7","key":"1434_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.ipl.2008.12.015","volume":"109","author":"Z Gotthilf","year":"2009","unstructured":"Gotthilf Z, Lewenstein M (2009) Improved algorithms for the k simple shortest paths and the replacement paths problems. Inform Process Lett 109(7):352\u2013355","journal-title":"Inform Process Lett"},{"issue":"4","key":"1434_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J Hershberger","year":"2007","unstructured":"Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans Algorithms 3(4):75","journal-title":"ACM Trans Algorithms"},{"key":"1434_CR10","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/320998.321004","volume":"6","author":"W Hoffman","year":"1959","unstructured":"Hoffman W, Pavley R (1959) A method of solution of the Nth best path problem. J ACM 6:506\u2013514","journal-title":"J ACM"},{"key":"1434_CR11","doi-asserted-by":"crossref","unstructured":"Hu XB, Wang M, Hu D et al (2012) A ripple-spreading algorithm for the k shortest paths problem. Third Global Congress on Intelligent Systems, pp 202\u2013208","DOI":"10.1109\/GCIS.2012.96"},{"key":"1434_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","volume":"1668","author":"VM Jimenez","year":"1999","unstructured":"Jimenez VM, Marzal A (1999) Computing the k shortest paths: a new algorithm and an experimental comparison. Lect Notes Comput Sci 1668:15\u201319","journal-title":"Lect Notes Comput Sci"},{"key":"1434_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","volume":"2647","author":"VM Jimenez","year":"2003","unstructured":"Jimenez VM, Marzal A (2003) A lazy version of Eppstein\u2019s shortest paths algorithm. Lect Notes Comput Sci 2647:179\u2013190","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"1434_CR14","first-page":"121","volume":"1","author":"EV Martins","year":"2003","unstructured":"Martins EV, Pascoal MB (2003) A new implementation of Yen\u2019s ranking loopless paths algorithm. Q J Belg Fr Ital Oper Res Soc 1(2):121\u2013133","journal-title":"Q J Belg Fr Ital Oper Res Soc"},{"key":"1434_CR15","doi-asserted-by":"crossref","unstructured":"Ozer B, Gezici G, Meydan C et al (2010) Multiple sequence alignment based on structural properties. Health Informatics and Bioinformatics (HIBIT), 2010 5th International Symposium on IEEE, pp 39\u201344","DOI":"10.1109\/HIBIT.2010.5478910"},{"issue":"20","key":"1434_CR16","doi-asserted-by":"crossref","first-page":"10244","DOI":"10.1016\/j.amc.2012.04.002","volume":"218","author":"A Sedeno-Noda","year":"2012","unstructured":"Sedeno-Noda A (2012) An efficient time and space K point-to-point shortest simple paths algorithm. Appl Math Comput 218(20):10244\u201310257","journal-title":"Appl Math Comput"},{"issue":"2","key":"1434_CR17","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.cor.2012.08.014","volume":"40","author":"A Sedeno-Noda","year":"2013","unstructured":"Sedeno-Noda A, Espino-Martin JJ (2013) On the K best integer network flows. Comput Oper Res 40(2):616\u2013626","journal-title":"Comput Oper Res"},{"issue":"12","key":"1434_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1093\/bioinformatics\/bts212","volume":"28","author":"YK Shih","year":"2012","unstructured":"Shih YK, Parthasarathy S (2012) A single source k-shortest paths algorithm to infer regulatory pathways in a gene network. Bioinformatics 28(12):49\u201358","journal-title":"Bioinformatics"},{"key":"1434_CR19","doi-asserted-by":"crossref","unstructured":"Wan X, Hua N, Zheng X (2012) Dynamic routing and spectrum assignment in spectrum-flexible transparent optical networks. J Opt Commun Netw 4(8):603\u2013613","DOI":"10.1364\/JOCN.4.000603"},{"issue":"8","key":"1434_CR20","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.cor.2010.02.005","volume":"39","author":"WT Xu","year":"2012","unstructured":"Xu WT, Sw He et al (2012) Finding the K shortest paths in a schedule-based transit network. Comput Oper Res 39(8):1812\u20131826","journal-title":"Comput Oper Res"},{"issue":"3","key":"1434_CR21","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2003.08.004","volume":"32","author":"HH Yang","year":"2005","unstructured":"Yang HH, Chen YL (2005) Finding K shortest looping paths in a traffic-light network. Comput Oper Res 32(3):571\u2013581","journal-title":"Comput Oper Res"},{"key":"1434_CR22","unstructured":"Yen JY (1972) Another algorithm for fiding the k shortest-loopless network paths. In 41st Mtg. Operations Research Society of America, vol 20, p B\/185"},{"key":"1434_CR23","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the K shortest loopless paths in a network. Manage Sci 17:712\u2013716","journal-title":"Manage Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1434-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1434-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1434-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:41Z","timestamp":1559079821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1434-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,21]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["1434"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1434-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,21]]}}}