{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:09:20Z","timestamp":1648519760459},"reference-count":22,"publisher":"Wiley","issue":"1-2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5710,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"DOI":"10.1002\/(sici)1098-2418(199701\/03)10:1\/2<187::aid-rsa10>3.0.co;2-6","type":"journal-article","created":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T07:27:49Z","timestamp":1098948469000},"page":"187-204","source":"Crossref","is-referenced-by-count":3,"title":["On finding a minimum spanning tree in a network with random weights"],"prefix":"10.1002","volume":"10","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harold S.","family":"Stone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000,1,13]]},"reference":[{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB1|cit1","volume-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB2|cit2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/rsa.3240010402","article-title":"A random tree model associated with random graphs","volume":"1","author":"Aldous","year":"1990","journal-title":"Random Struct. Alg."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB3|cit3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aop\/1176990534","article-title":"The continuum random tree I","volume":"19","author":"Aldous","year":"1991","journal-title":"Ann. Probab."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB4|cit4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1214\/aoap\/1177005936","article-title":"Asymptotic fringe distributions for general families of random trees","volume":"1","author":"Aldous","year":"1991","journal-title":"Ann. Appl. Probab."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB5|cit5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6353-9","volume-title":"Random Generation of Trees","author":"Alonso","year":"1995"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB6|cit6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1214\/aoap\/1177005773","article-title":"The minimum spanning tree constant in geometric probability and under the independent model: a unified approach","volume":"2","author":"Avram","year":"1992","journal-title":"Ann. Appl. Probab."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB7|cit7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/rsa.3240050103","article-title":"Random recursive forests","volume":"5","author":"Bali\u0144ska","year":"1994","journal-title":"Random Struct. Alg."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB8|cit8","volume-title":"Algorithmics","author":"Brassard","year":"1988"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB9|cit9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.3240070102","article-title":"The strong convergence of maximal degrees in uniform random recursive trees and dags","volume":"7","author":"Devroye","year":"1995","journal-title":"Random Struct. Alg."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB10|cit10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB11|cit11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","article-title":"On the value of a random minimum spanning tree problem","volume":"10","author":"Frieze","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB12|cit12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF02125348","article-title":"On random minimum length spanning trees","volume":"9","author":"Frieze","year":"1989","journal-title":"Combinatorica"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB13|cit13","volume-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB14|cit14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240070406","article-title":"The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph","volume":"7","author":"Janson","year":"1995","journal-title":"Random Struct. Alg."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB15|cit15","first-page":"57","article-title":"O jist\u00e9m problemu minim\u00e1lnim","volume":"6","author":"Jar\u0144ik","year":"1930","journal-title":"Acta Soc. Sci. Natur. Morauicae"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB16|cit16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0963548300000067","article-title":"Components of random forests","volume":"1","author":"\u0141uczak","year":"1992","journal-title":"Combinat. Probab. Comput."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB17|cit17","volume-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB18|cit18","series-title":"London Mathematical Society Lecture Note Series 141","first-page":"148","volume-title":"Surveys in Combinatorics","author":"McDiarmid","year":"1989"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB19|cit19","volume-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB20|cit20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240050207","article-title":"Note on the heights of random recursive trees and random m-ary search trees","volume":"5","author":"Pittel","year":"1994","journal-title":"Random Struct. Alg."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB21|cit21","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6-BIB22|cit22","first-page":"361","article-title":"On finding the expected length of a random minimal tree","volume":"32","author":"Timofeev","year":"1987","journal-title":"Theor. Probab. Appl."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1098-2418(199701%2F03)10:1%2F2%3C187::AID-RSA10%3E3.0.CO;2-6","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1098-2418(199701\/03)10:1\/2%3C187::AID-RSA10%3E3.0.CO;2-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T06:00:43Z","timestamp":1625119243000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1,13]]},"references-count":22,"journal-issue":{"issue":"1-2"},"URL":"https:\/\/doi.org\/10.1002\/(sici)1098-2418(199701\/03)10:1\/2<187::aid-rsa10>3.0.co;2-6","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1,13]]}}}