{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T01:45:49Z","timestamp":1771465549322,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":[[1989,12]]},"DOI":"10.1007\/bf02125348","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T18:43:33Z","timestamp":1126723413000},"page":"363-374","source":"Crossref","is-referenced-by-count":29,"title":["On random minimum length spanning trees"],"prefix":"10.1007","volume":"9","author":[{"given":"A. M.","family":"Frieze","sequence":"first","affiliation":[]},{"given":"C. J. H.","family":"McDiarmid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02125348_CR1","doi-asserted-by":"crossref","unstructured":"B.Bollob\u00e1s and I.Simon, On the expected behaviour of disjoint set union algorithms,Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, (1985) 224\u2013231.","DOI":"10.1145\/22145.22171"},{"key":"BF02125348_CR2","unstructured":"W.Feller,An Introduction to Probability Theory, Volume 1, John Wiley and Sons (1966)."},{"key":"BF02125348_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","volume":"10","author":"A. M. Frieze","year":"1985","unstructured":"A. M. Frieze, On the value of a random minimum spanning tree problem,Discrete Applied Mathematics,10 (1985) 47\u201356.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02125348_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02592060","volume":"36","author":"C. J. H. McDiarmid","year":"1986","unstructured":"C. J. H. McDiarmid, On the greedy algorithm with random costs,Mathematical Programming,36 (1986) 245\u2013255.","journal-title":"Mathematical Programming"},{"key":"BF02125348_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(87)90047-3","volume":"18","author":"M. J. Steele","year":"1987","unstructured":"M. J. Steele, On Frieze's\u03b6(3) limit for lengths of minimal spanning trees,Discrete Applied Mahtmeatics,18 (1987) 99\u2013103.","journal-title":"Discrete Applied Mahtmeatics"},{"key":"BF02125348_CR6","unstructured":"W. F.Stout,Almost Sure Convergence, Academic Press,1974."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125348.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02125348\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T13:07:07Z","timestamp":1586437627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02125348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF02125348"],"URL":"https:\/\/doi.org\/10.1007\/bf02125348","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}