{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:39:35Z","timestamp":1777131575895,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T00:00:00Z","timestamp":1201132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s00453-008-9164-4","type":"journal-article","created":{"date-parts":[[2008,1,23]],"date-time":"2008-01-23T17:50:09Z","timestamp":1201110609000},"page":"141-159","source":"Crossref","is-referenced-by-count":12,"title":["Note on the Structure of Kruskal\u2019s Algorithm"],"prefix":"10.1007","volume":"56","author":[{"given":"Nicolas","family":"Broutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Devroye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erin","family":"McLeish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,24]]},"reference":[{"key":"9164_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"key":"9164_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/rsa.3240010402","volume":"4","author":"D. Aldous","year":"1990","unstructured":"Aldous, D.: A random tree model associated with random graphs. Random Struct. Algorithms 4, 383\u2013402 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"9164_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01194923","volume":"92","author":"D. Aldous","year":"1992","unstructured":"Aldous, D., Steele, J.M.: Asymptotics for euclidean minimum spanning trees on random points. Probab. Theory Relat. Fields 92, 247\u2013258 (1992)","journal-title":"Probab. Theory Relat. Fields"},{"key":"9164_CR4","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"9164_CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/22145.22171","volume-title":"STOC \u201985: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B., Simon, I.: On the expected behavior of disjoint set union algorithms. In: STOC \u201985: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp.\u00a0224\u2013231. ACM, New York (1985)"},{"key":"9164_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1137\/0222064","volume":"22","author":"B. Bollob\u00e1s","year":"1993","unstructured":"Bollob\u00e1s, B., Simon, I.: Probabilistic analysis of disjoint set union algorithms. SIAM J. Comput. 22, 153\u20131074 (1993)","journal-title":"SIAM J. Comput."},{"key":"9164_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s002200100521","volume":"224","author":"C. Borgs","year":"2001","unstructured":"Borgs, C., Chayes, J.T., Kesten, H., Spencer, J.: The birth of the infinite cluster: Finite-size scaling in percolation. Commun. Math. Phys. 224, 153\u2013204 (2001)","journal-title":"Commun. Math. Phys."},{"key":"9164_CR8","first-page":"37","volume":"3","author":"O. Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Mor. P\u0159\u00edrodov\u011bd. Spol. v Brn\u011b (Acta Soc. Sci. Natur. Moravicae) 3, 37\u201358 (1926)","journal-title":"Pr\u00e1ce Mor. P\u0159\u00edrodov\u011bd. Spol. v Brn\u011b (Acta Soc. Sci. Natur. Moravicae)"},{"key":"9164_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"9164_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"9164_CR11","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"9164_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"Frieze, A.M.: On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10, 47\u201356 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9164_CR13","series-title":"A Series of Comprehensive Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03981-6","volume-title":"Percolation","author":"G.R. Grimmett","year":"1999","unstructured":"Grimmett, G.R.: Percolation, 2nd edn. A Series of Comprehensive Studies in Mathematics, vol.\u00a0321. Springer, New York (1999)","edition":"2"},{"key":"9164_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"9164_CR15","first-page":"57","volume":"6","author":"V. Jar\u0144ik","year":"1930","unstructured":"Jar\u0144ik, V.: O jist\u00e9m probl\u00e9mu minim\u00e1lnim. Pr\u00e1ce Mor. P\u0159\u00edrodov\u011bd. Spol. v Brn\u011b (Acta Soc. Sci. Natur. Moravicae) 6, 57\u201363 (1930)","journal-title":"Pr\u00e1ce Mor. P\u0159\u00edrodov\u011bd. Spol. v Brn\u011b (Acta Soc. Sci. Natur. Moravicae)"},{"key":"9164_CR16","volume-title":"Percolation Theory for Mathematicians","author":"H. Kesten","year":"1980","unstructured":"Kesten, H.: Percolation Theory for Mathematicians. Birkh\u00e4user, Boston (1980)"},{"key":"9164_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","volume":"6","author":"D.E. Knuth","year":"1978","unstructured":"Knuth, D.E., Sch\u00f6nhage, A.: The expected linearity of a simple equivalence algorithm. Theor. Comput. Sci. 6, 281\u2013315 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"9164_CR18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"2","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 2, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20132","key":"9164_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.3.CO;2-Y","volume":"10","author":"C. McDiarmid","year":"1997","unstructured":"McDiarmid, C., Johnson, T., Stone, H.S.: On finding a minimum spanning tree in a network with random weights. Random Struct. Algorithms 10(1\u20132), 187\u2013204 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"9164_CR20","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511895357","volume-title":"Continuum Percolation","author":"R. Meester","year":"1996","unstructured":"Meester, R., Roy, R.: Continuum Percolation. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1996)"},{"issue":"2","key":"9164_CR21","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1214\/aoap\/1034625335","volume":"7","author":"M. Penrose","year":"1997","unstructured":"Penrose, M.: The longest edge of a random minimal spanning tree. Ann. Appl. Probab. 7(2), 340\u2013361 (1997)","journal-title":"Ann. Appl. Probab."},{"key":"9164_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/(SICI)1098-2418(199801)12:1<63::AID-RSA4>3.0.CO;2-R","volume":"12","author":"M. Penrose","year":"1998","unstructured":"Penrose, M.: Random minimal spanning tree and percolation on the n-cube. Random Struct. Algorithms 12, 63\u201382 (1998)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"9164_CR23","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1214\/aop\/1022677261","volume":"27","author":"M. Penrose","year":"1999","unstructured":"Penrose, M.: A strong law for the longest edge of the minimal spanning tree. Ann. Probab. 27(1), 246\u2013260 (1999)","journal-title":"Ann. Probab."},{"key":"9164_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs. Oxford Studies in Probability","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability. Oxford University Press, Oxford (2003)"},{"key":"9164_CR25","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"9164_CR26","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970029","volume-title":"Probability Theory and Combinatorial Optimization","author":"J.M. Steele","year":"1997","unstructured":"Steele, J.M.: Probability Theory and Combinatorial Optimization. CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia (1997)"},{"key":"9164_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: On the average behavior of set merging algorithms. In: STOC \u201976: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp.\u00a0192\u2013195 (1976)","DOI":"10.1145\/800113.803648"},{"key":"9164_CR28","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093472","volume-title":"Probability Theory of Classical Euclidean Optimization Problems","author":"J.E. Yukich","year":"1998","unstructured":"Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol.\u00a01675. Springer, New York (1998)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,24]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9164"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9164-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,24]]}}}