{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:36:34Z","timestamp":1649075794350},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0020-0190(94)00173-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"55-59","source":"Crossref","is-referenced-by-count":0,"title":["Element perturbation problems of optimum spanning trees with two-parameter objectives"],"prefix":"10.1016","volume":"53","author":[{"given":"Yung-Cheng","family":"Chang","sequence":"first","affiliation":[]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00173-V_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(94)00173-V_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(84)90013-1","article-title":"Polynomial testing of the Query a\u201cIs b > cd?\u201d with application on finding a minimal cost reliability ratio spanning tree","volume":"9","author":"Chandrasekaran","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(94)00173-V_BIB3","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/moor.14.2.362","article-title":"Maximizing classes of two-parameter objectives over matroids","volume":"14","author":"Hassin","year":"1989","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(94)00173-V_BIB4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(91)90028-G","article-title":"Finding the most vital edge with respect to minimum spanning tree in weighted graphs","volume":"39","author":"Hsu","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00173-V_BIB5","unstructured":"L.H. Hsu, S.C. Leu and T.Y. Sung, Second optimal solutions, critical elements and recycling algorithms, submitted for publication."},{"key":"10.1016\/0020-0190(94)00173-V_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230230413","article-title":"The most vital edges for matchings in a bipartite graph","volume":"23","author":"Hung","year":"1993","journal-title":"Networks"},{"key":"10.1016\/0020-0190(94)00173-V_BIB7","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","article-title":"An efficient algorithm for K shortest simple paths","volume":"12","author":"Katoh","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0020-0190(94)00173-V_BIB8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.4.1.70","article-title":"Matroid applications and algorithms","volume":"4","author":"Lee","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0020-0190(94)00173-V_BIB9","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."},{"key":"10.1016\/0020-0190(94)00173-V_BIB10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400173V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400173V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:57:54Z","timestamp":1555282674000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400173V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["002001909400173V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00173-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}