{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:54Z","timestamp":1725544914536},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_31","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"278-287","source":"Crossref","is-referenced-by-count":6,"title":["Finding the Most Vital Node of a Shortest Path"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"M.O. Ball","year":"1989","unstructured":"M.O. Ball, B.L. Golden and R.V. Vohra, Finding the most vital arcs in a network, Oper. Res. Letters, 8 (1989) 73\u201376.","journal-title":"Oper. Res. Letters"},{"key":"31_CR2","unstructured":"A. Bar-Noy, S. Khuller and B. Schieber, The complexity of finding most vital arcs and nodes. TR CS-TR-3539, Institute for Advanced Studies, Universityof Maryland, College Park, MD, 1995."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H.W. Corleyand","year":"1982","unstructured":"H.W. Corleyand D.Y. Sha, Most vital links and nodes in weighted networks, Oper. Res. Letters, 1 (1982) 157\u2013160.","journal-title":"Oper. Res. Letters"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math., 1 (1959) 269\u2013271.","journal-title":"Numer. Math"},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34(3) (1987) 596\u2013615.","journal-title":"Journal of the ACM"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"K. Malik, A.K. Mittal and S.K. Gupta, The k most vital arcs in the shortest path problem, Oper. Res. Letters, 8 (1989) 223\u2013227.","journal-title":"Oper. Res. Letters"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(98)00077-5","volume":"67","author":"E. Nardelli","year":"1998","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, Finding the detour-critical edge of a shortest path between two nodes, Info. Proc. Letters,67(1) (1998) 51\u201354.","journal-title":"Info. Proc. Letters"},{"key":"31_CR8","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, A faster computation of the most vital edge of a shortest path between two nodes, Info. Proc. Letters, to appear. Also available as TR 15-99, Dipartimento di Matematica Pura ed Applicata, University of L\u2019Aquila, L\u2019Aquila, Italy, April 1999."},{"key":"31_CR9","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. of the 16th Symp. on Theoretical Aspects of Computer Science (STACS\u201999)","author":"N. Nisan","year":"1999","unstructured":"N. Nisan, Algorithms for selfish agents, Proc. of the 16th Symp. on Theoretical Aspects of Computer Science (STACS\u201999), Lecture Notes in Computer Science, Vol. 1563, Springer, (1999) 1\u201315."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"N. Nisan and A. Ronen, Algorithmic mechanism design, Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC\u201999), (1999) 129\u2013140.","DOI":"10.1145\/301250.301287"},{"key":"31_CR11","volume-title":"Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers","author":"J.S. Rosenschein","year":"1994","unstructured":"J.S. Rosenschein and G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, Cambridge, Massachusetts, 1994."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, Efficiencyof a good but not linear set union algorithm, Journal of the ACM, 22 (1975) 215\u2013225.","journal-title":"Journal of the ACM"},{"key":"31_CR13","unstructured":"S. Venema, H. Shen and F. Suraweera, A parallel algorithm for the single most vital vertex problem with respect to single source shortest paths, Online Proc. of the First Int. Conf. on Parallel and Distributed Computing, Applications and Technologies (PDCAT\u20192000), Chapter 22, http:\/\/www2.comp.polyu.edu.hk\/PDCAT2000\/publish.html ."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T21:32:36Z","timestamp":1558819956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}