{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:05Z","timestamp":1725664565446},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:53:37Z","timestamp":1330260817000},"page":"440-448","source":"Crossref","is-referenced-by-count":12,"title":["A simpler minimum spanning tree verification algorithm"],"prefix":"10.1007","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"B. Dixon, M. Rauch, R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM Journal of Computing, vol.21. Nov. 6, pp.1184\u20131192, (Dec. 1992).","journal-title":"SIAM Journal of Computing"},{"key":"38_CR2","doi-asserted-by":"publisher","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. Computing, vol. 13 (1984), pp. 338\u2013355.","journal-title":"SIAM J. Computing"},{"key":"38_CR3","unstructured":"D. Karger. Global min-cuts in RNC and other ramifications of a simple mincut algorithm,\u201d Proc. 4\n                  th\n                \nAnnual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp.21\u201330."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"P. Klein and R. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees, Twenty-Sixth Annual ACM Symposium on Theory of Computing, (1994), pp. 9\u201315.","DOI":"10.1145\/195058.195084"},{"key":"38_CR5","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), pp.57\u201365.(Also in FOCS 1984.)","journal-title":"Combinatorica"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"11253","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), pp. 11253\u20131262.","journal-title":"SIAM J. Comput."},{"key":"38_CR7","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), pp.690\u2013715.","journal-title":"J.Assoc. Comput. Mach."},{"key":"38_CR8","unstructured":"R. Tarjan. Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Math. vol. 44, SIAM (1983)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:33:49Z","timestamp":1619559229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}