{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:16:13Z","timestamp":1648883773412},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10878-012-9553-0","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T13:39:04Z","timestamp":1349962744000},"page":"798-807","source":"Crossref","is-referenced-by-count":1,"title":["Faster algorithm to find anti-risk path between two nodes of an undirected graph"],"prefix":"10.1007","volume":"27","author":[{"given":"Jay","family":"Mahadeokar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,12]]},"reference":[{"key":"9553_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading"},{"key":"9553_CR2","volume-title":"Graph theory with applications to engineering and computer science","author":"N Deo","year":"1974","unstructured":"Deo N (1974) Graph theory with applications to engineering and computer science. Prentice-Hall, New York"},{"issue":"4","key":"9553_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(4):269\u2013271","journal-title":"Numer Math"},{"issue":"3","key":"9553_CR4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman M, Tarjan R (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596\u2013615","journal-title":"J ACM"},{"key":"9553_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(00)00175-7","volume":"79","author":"E Nardelli","year":"2001","unstructured":"Nardelli E, Proietti G, Widmayer P (2001) Faster computation of the most vital edge of a shortest path. Inf Process Lett 79:81\u201385","journal-title":"Inf Process Lett"},{"issue":"1","key":"9553_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(98)00077-5","volume":"67","author":"E Nardelli","year":"1998","unstructured":"Nardelli E, Proietti G, Widmayer P (1998) Finding the detour-critical edge of a shortest path between two nodes. Inf Process Lett 67(1):51\u201354","journal-title":"Inf Process Lett"},{"key":"9553_CR7","first-page":"150","volume-title":"SODA\u201910","author":"H Yuan","year":"2010","unstructured":"Yuan H, Attalah M (2010) Data structures for range minimum queries in multidimensional arrays. In: SODA\u201910, pp 150\u2013160"},{"key":"9553_CR8","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R Tarjan","year":"1979","unstructured":"Tarjan R (1979) Applications of path compression on balanced trees. J ACM 26:690\u2013715","journal-title":"J ACM"},{"issue":"1","key":"9553_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R Tarjan","year":"1982","unstructured":"Tarjan R (1982) Sensitivity analysis of minimum spanning trees and shortest path trees. Inf Process Lett 14(1):30\u201333","journal-title":"Inf Process Lett"},{"key":"9553_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10878-007-9110-4","volume":"17","author":"P Xiao","year":"2009","unstructured":"Xiao P, Xu Y, Su B (2009) Finding an anti-risk path between two nodes in undirected graphs. J Comb Optim 17:235\u2013246","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9553-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9553-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9553-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:19Z","timestamp":1559262199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9553-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9553"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9553-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}