{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:30Z","timestamp":1725540690406},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_10","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"81-85","source":"Crossref","is-referenced-by-count":1,"title":["Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter"],"prefix":"10.1007","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","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O. Berkman","year":"1993","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms\u00a014, 344\u2013370 (1993)","journal-title":"J. Algorithms"},{"key":"10_CR2","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall (1974)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proc. FOCS, pp. 252\u2013259 (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Erratum to \u201dVickrey Pricing and Shortest Paths: What is an Edge Worth? In: FOCS, p. 809 (2002)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P., Rao, D., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci.\u00a055, 3\u201333 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The most vital arcs in the shortest path problem. Oper. Res. Letters\u00a08, 223\u2013227 (1989)","journal-title":"Oper. Res. Letters"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(02)00438-3","volume":"296","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding the most vital node of a shortest path. Theoretical Computer Science\u00a0296, 167\u2013177 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","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.: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett.\u00a079(2), 81\u201385 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R. Tarjan","year":"1982","unstructured":"Tarjan, R.: Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. Information Processing Letters\u00a014(1), 30\u201333 (1982)","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R. Tarjan","year":"1979","unstructured":"Tarjan, R.: Applications of path compression on balanced trees. J. ACM\u00a026, 690\u2013715 (1979)","journal-title":"J. ACM"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BFb0028545","volume-title":"STACS 98","author":"M. Thorup","year":"1998","unstructured":"Thorup, M.: Floats, Integers, and Single Source Shortest Paths. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 14\u201324. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:44Z","timestamp":1620135224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}