{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:50:32Z","timestamp":1780822232269,"version":"3.54.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf02526037","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T04:45:41Z","timestamp":1162961141000},"page":"263-270","source":"Crossref","is-referenced-by-count":55,"title":["A simpler minimum spanning tree verification algorithm"],"prefix":"10.1007","volume":"18","author":[{"given":"V.","family":"King","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"BF02526037_CR1","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"B. Dixon, M. Rauch, and R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time,SIAM J. Comput.,21(6) (1992), 1184\u20131192.","journal-title":"SIAM J. Comput."},{"key":"BF02526037_CR2","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors,SIAM J. Comput.,13 (1984), 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"BF02526037_CR3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/201019.201022","volume":"42","author":"D. Karger","year":"1995","unstructured":"D. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees,J. Assoc. Comput. Mach.,42 (1995), 321\u2013328.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02526037_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02579443","volume":"5","author":"J. Koml\u00f3s","year":"1985","unstructured":"J. Koml\u00f3s, Linear verification for spanning trees,Combinatorica,5 (1985), 57\u201365.","journal-title":"Combinatorica"},{"key":"BF02526037_CR5","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization,SIAM J. Comput.,17 (1988), 1253\u20131262.","journal-title":"SIAM J. Comput."},{"key":"BF02526037_CR6","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R. Tarjan","year":"1979","unstructured":"R. Tarjan, Applications of path compressions on balanced trees,J. Assoc. Comput. Mach.,26 (1979), 690\u2013715.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02526037_CR7","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. Tarjan","year":"1983","unstructured":"R. Tarjan,Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983, p. 73."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02526037.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02526037\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02526037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:52:42Z","timestamp":1558299162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02526037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF02526037"],"URL":"https:\/\/doi.org\/10.1007\/bf02526037","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}