{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T19:59:02Z","timestamp":1696363142844},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T00:00:00Z","timestamp":1267747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00453-010-9402-4","type":"journal-article","created":{"date-parts":[[2010,3,4]],"date-time":"2010-03-04T10:26:22Z","timestamp":1267698382000},"page":"402-418","source":"Crossref","is-referenced-by-count":9,"title":["A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs"],"prefix":"10.1007","volume":"61","author":[{"given":"Kuo-Hua","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justie Su-Tzu","family":"Juan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,5]]},"reference":[{"key":"9402_CR1","first-page":"97","volume":"2","author":"S.C. Barman","year":"2007","unstructured":"Barman, S.C., Mondal, S., Pal, M.: An efficient algorithm to find next-to-shortest path on trapezoid graphs. Adv. Appl. Math. Anal. 2, 97\u2013107 (2007)","journal-title":"Adv. Appl. Math. Anal."},{"key":"9402_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"9402_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ipl.2004.06.020","volume":"92","author":"I. Krasiko","year":"2004","unstructured":"Krasiko, I., Noble, S.D.: Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92, 117\u2013119 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9402_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0020-0190(97)00122-1","volume":"63","author":"K.N. Lalgudi","year":"1997","unstructured":"Lalgudi, K.N., Papaefthymiou, M.C.: Computing strictly-second shortest paths. Inf. Process. Lett. 63, 177\u2013181 (1997)","journal-title":"Inf. Process. Lett."},{"key":"9402_CR5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.ipl.2006.04.013","volume":"99","author":"S. Li","year":"2006","unstructured":"Li, S., Sun, G., Chen, G.: Improved algorithm for finding next-to-shortest paths. Inf. Process. Lett. 99, 192\u2013194 (2006)","journal-title":"Inf. Process. Lett."},{"key":"9402_CR6","first-page":"201","volume":"10","author":"S. Mondal","year":"2006","unstructured":"Mondal, S., Pal, M.: A sequential algorithm to solve next-to-shortest path problem on circular-arc graphs. J. Phys. Sci. 10, 201\u2013217 (2006)","journal-title":"J. Phys. Sci."},{"key":"9402_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R. Tarjan","year":"1974","unstructured":"Tarjan, R.: Finding dominators in directed graphs. SIAM J. Comput. 3, 62\u201389 (1974)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9402-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9402-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9402-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:05Z","timestamp":1559123105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9402-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9402-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,5]]}}}