{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:21:29Z","timestamp":1743013289116,"version":"3.40.3"},"publisher-location":"New Delhi","reference-count":12,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132218555"},{"type":"electronic","value":"9788132218562"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1856-2_9","type":"book-chapter","created":{"date-parts":[[2014,3,11]],"date-time":"2014-03-11T10:15:09Z","timestamp":1394532909000},"page":"77-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Swap Edges of Shortest Path Tree in Parallel"],"prefix":"10.1007","author":[{"given":"Anjeneya Swami","family":"Kare","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":[[2014,3,12]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest paths tree is good and fast. Algorithmica 35(1), 56\u201374 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR2","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. 79(2), 81\u201385 (2001)","journal-title":"Inf. Process. Lett."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jda.2013.08.001","volume":"23","author":"J Mahadeokar","year":"2013","unstructured":"Mahadeokar, J., Saxena, S.: Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs. J. Discrete Algorithms 23, 54\u201362 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"9_CR4","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 K most vital arcs in the shortest path problem. Oper. Res. Letters 8, 223\u2013227 (1989)","journal-title":"Oper. Res. Letters"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"9_CR6","unstructured":"JaJa, J.: Introduction to Parallel Algorithms. Addison-Wesley, Boston (1992)"},{"key":"9_CR7","unstructured":"Das, S.K., Chen, C.Y.: Cost-optimal parallel algorithms for traversing trees. In: IEEE Proceedings of SOUTHEASTCON \u201891 (Cat. No.91CH2998-3), vol. 1, pp. 474\u2013478, (1991)"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/BF01759076","volume":"6","author":"RJ Anderson","year":"1991","unstructured":"Anderson, R.J., Miller, G.L.: Deterministic parallel list ranking. Algorithmica 6(6), 859\u2013868 (1991)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32\u201353 (1986)","journal-title":"Inf. Control"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S Albers","year":"1997","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Inf. Comput. 136(1), 25\u201351 (1997)","journal-title":"Inf. Comput."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R Cole","year":"1988","unstructured":"Cole, R.: Parallel merge sort. SIAM J. Comput. 17(4), 770\u2013785 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR12","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 14(3), 344\u2013370 (1993)","journal-title":"J. Algorithms"}],"container-title":["Advances in Intelligent Systems and Computing","Recent Advances in Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1856-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T07:34:38Z","timestamp":1675236878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1856-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132218555","9788132218562"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1856-2_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}