{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T18:20:16Z","timestamp":1772562016333,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/0166-218x(85)90058-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"47-56","source":"Crossref","is-referenced-by-count":124,"title":["On the value of a random minimum spanning tree problem"],"prefix":"10.1016","volume":"10","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90058-7_BIB1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5A","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hungarian Acad. Sci."},{"key":"10.1016\/0166-218X(85)90058-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579431","article-title":"On the connectivity of random m-orientable graphs and digraphs","volume":"2","author":"Fenner","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(85)90058-7_BIB3","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0166-218X(85)90058-7_BIB4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0210024","article-title":"Optimisation problems on graphs with independent random edge weights","volume":"10","author":"Lueker","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90058-7_BIB5","article-title":"Growth rates of minimal spanning trees of multivariate sample","author":"Steele","year":"1981","journal-title":"Stanford Univ., Dept. of Statistics, Research Report"},{"key":"10.1016\/0166-218X(85)90058-7_BIB6","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","article-title":"On the expected value of a random assignment problem","volume":"8","author":"Walkup","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:51:11Z","timestamp":1554907871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0166218X85900587"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90058-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}