{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:32:51Z","timestamp":1673483571840},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1007\/bf02579443","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:18:25Z","timestamp":1174601905000},"page":"57-65","source":"Crossref","is-referenced-by-count":39,"title":["Linear verification for spanning trees"],"prefix":"10.1007","volume":"5","author":[{"given":"J.","family":"Koml\u00f3s","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579443_CR1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"D. Cheriton andR. E. Tarjan, Finding Minimum Spanning Trees,SIAM J. on Computing,5 (1976), 724\u2013742.","journal-title":"SIAM J. on Computing"},{"key":"BF02579443_CR2","unstructured":"M. Fredman andR. E. Tarjan,private communication, December 1983."},{"key":"BF02579443_CR3","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/322203.322206","volume":"27","author":"R. L. Graham","year":"1980","unstructured":"R. L. Graham, A. C. Yao, andF. F. Yao, Information Bounds are Weak in the Shortest Distance Problem,JACM,27 (1980), 428- 444.","journal-title":"JACM"},{"key":"BF02579443_CR4","doi-asserted-by":"crossref","unstructured":"D. Harel, A Linear Time Algorithm for the Lowest Common Ancestors Problem,Proc. 21st Annual Symp. on Foundations of Computer Science, (1980), 308\u2013319.","DOI":"10.1109\/SFCS.1980.6"},{"key":"BF02579443_CR5","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R. E. Tarjan","year":"1979","unstructured":"R. E. Tarjan, Application of Path Compression on Balanced Trees,JACM,26 (1979), 690\u2013715.","journal-title":"JACM"},{"key":"BF02579443_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A. C. Yao","year":"1975","unstructured":"A. C. Yao, AnO(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees,Information Processing Letters,4 (1975), 21\u201323.","journal-title":"Information Processing Letters"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:04Z","timestamp":1558197904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["BF02579443"],"URL":"https:\/\/doi.org\/10.1007\/bf02579443","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}