{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:18:36Z","timestamp":1767838716033,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0020-0190(00)00175-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:16Z","timestamp":1027607296000},"page":"81-85","source":"Crossref","is-referenced-by-count":70,"title":["A faster computation of the most vital edge of a shortest path"],"prefix":"10.1016","volume":"79","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00175-7_BIB001","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","article-title":"The k most vital arcs in the shortest path problem","volume":"8","author":"Malik","year":"1989","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(00)00175-7_BIB002","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(98)00077-5","article-title":"Finding the detour-critical edge of a shortest path between two nodes","volume":"67","author":"Nardelli","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00175-7_BIB003","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","article-title":"A note on finding the bridges of a graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00175-7_BIB004","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00175-7_BIB005","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70326-1","article-title":"Complexity of monotone networks of computing conjunctions","volume":"2","author":"Tarjan","year":"1975","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0020-0190(00)00175-7_BIB006","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","article-title":"Applications of path compression on balanced trees","volume":"26","author":"Tarjan","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00175-7_BIB007","series-title":"Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), Paris, France, February 25\u201327","first-page":"14","article-title":"Floats, integers, and single source shortest paths","volume":"1373","author":"Thorup","year":"1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001757?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001757?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:23:58Z","timestamp":1556439838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0020019000001757"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00175-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}