{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:12:28Z","timestamp":1648721548954},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T00:00:00Z","timestamp":1433376000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9912-8","type":"journal-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T09:20:46Z","timestamp":1433323246000},"page":"917-926","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding a contra-risk path between two nodes in undirected graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iman","family":"Keshtkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"key":"9912_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs"},{"key":"9912_CR2","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1007\/s10878-012-9553-0","volume":"27","author":"J Mahadeokar","year":"2014","unstructured":"Mahadeokar J, Saxena S (2014) Faster algorithm to find anti-risk path between two nodes of an undirected graph. J Comb Optim 27:798\u2013807","journal-title":"J Comb Optim"},{"issue":"4","key":"9912_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K Malik","year":"1989","unstructured":"Malik K, Mittal AK, Gupta SK (1989) The k most vital arcs in the shortest path problem. Oper Res Lett 8(4):223\u2013227","journal-title":"Oper Res Lett"},{"issue":"1","key":"9912_CR4","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":"9912_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"},{"key":"9912_CR6","first-page":"278","volume-title":"Computing and combinatorics, volume 2108 of lecture notes in computer science","author":"E Nardelli","year":"2001","unstructured":"Nardelli E, Proietti G, Widmayer P (2001) Finding the most vital node of a shortest path. In: Wang Jie (ed) Computing and combinatorics, volume 2108 of lecture notes in computer science. Springer, Berlin, pp 278\u2013287"},{"key":"9912_CR7","doi-asserted-by":"crossref","unstructured":"Nisan N, Ronen A (1999) Algorithmic mechanism design (extended abstract). STOC\u201999, New York, NY, USA","DOI":"10.1145\/301250.301287"},{"key":"9912_CR8","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"},{"key":"9912_CR9","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10878-014-9766-5","volume":"29","author":"H Zhang","year":"2014","unstructured":"Zhang H, Xu Y, Wen X (2014) Optimal shortest path set problem in undirected graphs. J Comb Optim 29:511\u2013530","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-015-9912-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9912-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9912-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T01:27:27Z","timestamp":1566782847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9912-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,4]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9912"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9912-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,4]]}}}