{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:17:50Z","timestamp":1771913870898,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":[[1991,9]]},"DOI":"10.1016\/0020-0190(91)90028-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"277-281","source":"Crossref","is-referenced-by-count":35,"title":["Finding the most vital edge with respect to minimum spanning tree in weighted graphs"],"prefix":"10.1016","volume":"39","author":[{"given":"Lih-Hsing","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Rong-Hong","family":"Jan","sequence":"additional","affiliation":[]},{"given":"Yu-Che","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Chun-Nan","family":"Hung","sequence":"additional","affiliation":[]},{"given":"Maw-Sheng","family":"Chern","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90028-G_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","article-title":"Finding the most vital arcs in a network","volume":"8","author":"Ball","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(91)90028-G_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","article-title":"Most vital links and nodes in weighted networks","volume":"1","author":"Corley","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(91)90028-G_BIB3","series-title":"Graph Theory","author":"Gould","year":"1988"},{"key":"10.1016\/0020-0190(91)90028-G_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning sub-tree and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(91)90028-G_BIB5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalisations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0190(91)90028-G_BIB6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"On the efficiency of a good but not linear set merging algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190028G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190028G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:25:02Z","timestamp":1555143902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190028G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["002001909190028G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90028-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}