{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:36:56Z","timestamp":1730227016692,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/ic3.2013.6612164","type":"proceedings-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T14:38:09Z","timestamp":1380638289000},"page":"70-75","source":"Crossref","is-referenced-by-count":0,"title":["Efficient solutions for finding vitality with respect to shortest paths"],"prefix":"10.1109","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":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1080"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90020-7"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"3","first-page":"249","article-title":"Replacement paths and k simple shortest paths in unweighted directed graphs","volume":"3580","author":"roditty","year":"2005","journal-title":"LNCS"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90065-5"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00175-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00438-3"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35926-2_10"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.08.008"},{"key":"4","first-page":"94","article-title":"Replacement paths for pairs of shortest path edges in directed graphs","volume":"16","author":"bhosle","year":"2004","journal-title":"Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00172-X"},{"key":"8","first-page":"197","article-title":"Finding the most vital edge for graph minimization problems on meshes and hypercubes","volume":"3","author":"liang","year":"2000","journal-title":"International Journal of Parallel and Distributed Systems and Networks"}],"event":{"name":"2013 Sixth International Conference on Contemporary Computing (IC3)","start":{"date-parts":[[2013,8,8]]},"location":"Noida, India","end":{"date-parts":[[2013,8,10]]}},"container-title":["2013 Sixth International Conference on Contemporary Computing (IC3)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6595807\/6612154\/06612164.pdf?arnumber=6612164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T22:57:23Z","timestamp":1490223443000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6612164\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ic3.2013.6612164","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}