{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:03:22Z","timestamp":1725606202374},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231773"},{"type":"electronic","value":"9783642231780"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_16","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T07:15:58Z","timestamp":1315638958000},"page":"182-191","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph"],"prefix":"10.1007","author":[{"given":"Anna","family":"Nepomniaschaya","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","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. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k Shortest Paths. SIAM J. of Computing\u00a028, 652\u2013673 (1998)","journal-title":"SIAM J. of Computing"},{"unstructured":"Foster, C.C.: Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)","key":"16_CR3"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ipl.2008.12.015","volume":"109","author":"Z. Gotthilf","year":"2009","unstructured":"Gotthilf, Z., Lewenstein, M.: Improved Algorithms for the k Simple Shortest Paths and the Replacement Paths Problems. Information Processing Letters\u00a0109, 352\u2013355 (2009)","journal-title":"Information Processing Letters"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N. Katoh","year":"1982","unstructured":"Katoh, N., Ibaraki, T., Mine, H.: An Efficient Algorithm for k Shortest Simple Paths. Networks\u00a012, 411\u2013427 (1982)","journal-title":"Networks"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A Procedure for Computing the k Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"},{"key":"16_CR7","first-page":"258","volume-title":"Proc. of the Intern. Conf. \u201dParallel Computing Technologies","author":"A.S. Nepomniaschaya","year":"1991","unstructured":"Nepomniaschaya, A.S.: Language STAR for Associative and Parallel Computation with Vertical Data Processing. In: Mirenkov, N. (ed.) Proc. of the Intern. Conf. \u201dParallel Computing Technologies, pp. 258\u2013265. World Scientific, Singapore (1991)"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-2000-43123412","volume":"43","author":"A.S. Nepomniaschaya","year":"2000","unstructured":"Nepomniaschaya, A.S., Dvoskina, M.A.: A Simple Implementation of Dijkstra\u2019s Shortest Path Algorithm on Associative Parallel Processors. Fundamenta Informaticae\u00a043, 227\u2013243 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"16_CR9","first-page":"665","volume-title":"Proc. of the Intern. Conf. \u201dInformation Visualization\u201d, IV 2003","author":"A.S. Nepomniaschaya","year":"2003","unstructured":"Nepomniaschaya, A.S.: Simultaneous Finding the Shortest Paths and Distances in Directed Graphs Using Associative Parallel Processors. In: Proc. of the Intern. Conf. \u201dInformation Visualization\u201d, IV 2003, pp. 665\u2013670. IEEE Computer Society, Los Alamitos (2003)"},{"key":"16_CR10","first-page":"399","volume-title":"Proc. of the Intern. Conf. on Parallel Computing in Electrical Engineering, PARELEC 2002","author":"A.S. Nepomniaschaya","year":"2002","unstructured":"Nepomniaschaya, A.S.: Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. In: Proc. of the Intern. Conf. on Parallel Computing in Electrical Engineering, PARELEC 2002, pp. 399\u2013404. IEEE Computer Society, Los Alamitos (2002)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11523468_21","volume-title":"Automata, Languages and Programming","author":"L. Roditty","year":"2005","unstructured":"Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 249\u2013260. Springer, Heidelberg (2005)"},{"issue":"11","key":"16_CR12","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k Shortest Loopless Paths in a Network. Management Science\u00a017(11), 712\u2013716 (1971)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T14:03:11Z","timestamp":1592920991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}