{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:27:30Z","timestamp":1649028450784},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf01954898","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:33:57Z","timestamp":1122856437000},"page":"785-789","source":"Crossref","is-referenced-by-count":0,"title":["On a proposed divide-and-conquer minimal spanning tree algorithm"],"prefix":"10.1007","volume":"28","author":[{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01954898_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01939358","volume":"26","author":"R. C. Chang","year":"1986","unstructured":"R. C. Chang and R. C. T. Lee,An O(N logN)minimal spanning tree algorithm for N points in the plane, BIT 26 (1986), 7\u201316.","journal-title":"BIT"},{"key":"BF01954898_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook,A taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), 2\u201322.","journal-title":"Information and Control"},{"key":"BF01954898_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal Jr.","year":"1956","unstructured":"J. B. Kruskal, Jr.,On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956), 48\u201350.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01954898_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee and B. J. Schachter,Two algorithms for constructing Delaunay triangulations, International Journal of Computer and Information Sciences 9 (1980), 219\u2013242.","journal-title":"International Journal of Computer and Information Sciences"},{"key":"BF01954898_CR5","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey,Closest point problems, 16th Annual IEEE Symp. on Foundations of Computer Science (1975), 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01954898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:20:51Z","timestamp":1557768051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01954898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF01954898"],"URL":"https:\/\/doi.org\/10.1007\/bf01954898","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}