Portal de Periódicos da CAPES

Random Minimal Trees

1985; Society for Industrial and Applied Mathematics; Volume: 29; Issue: 1 Linguagem: Inglês

10.1137/1129016

1095-7219

Е. А. Тимофеев,

Advanced Graph Theory Research

Previous article Next article Random Minimal TreesE. A. TimofeevE. A. Timofeevhttps://doi.org/10.1137/1129016PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] J. Beardwood, , J. H. Halton and , J. Hammersley, The shortest path through many points, Proc. Cambridge Philos. Soc., 55 (1959), 299–327 22:202 0118.35601 CrossrefGoogle Scholar[2] A. A. Borovkov, A probabilistic formulation of two economic problems, Soviet Math. Doklady, 3 (1962), 1403–1406 Google Scholar[3] E. N. Gilbert, Random minimal trees, SIAM J. Appl. Math., 13 (1965), 376–387 10.1137/0113021 LinkGoogle Scholar[4] David W. Walkup, On the expected value of a random assignment problem, SIAM J. Comput., 8 (1979), 440–442 10.1137/0208036 80e:68176 0413.68062 LinkGoogle Scholar[5] R. K. Prim, Shortest connecting networks and some generalizationsCybernetic Transactions, Vol. 2, Nauka, Moscow, 1961, 95–107, (In Russian.) Google Scholar[6] Richard M. Karp, A patching algorithm for the nonsymmetric traveling-salesman problem, SIAM J. Comput., 8 (1979), 561–573 10.1137/0208045 82c:90057 0427.90064 LinkGoogle Scholar[7] Jacques Neveu, Mathematical foundations of the calculus of probability, Translated by Amiel Feinstein, Holden-Day Inc., San Francisco, Calif., 1965xiii+223 33:6660 Google Scholar[8] G. M. Fikhtengol'ts, Course in Differential and Integral Calculus, Vol. 2, Nauka, Moscow, 1969, (In Russian.) Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Urban Flood-Risk Assessment: Integration of Decision-Making and Machine Learning9 April 2022 | Sustainability, Vol. 14, No. 8 Cross Ref Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms Cross Ref On Finding the Expected Length of a Random Minimal Tree17 July 2006 | Theory of Probability & Its Applications, Vol. 33, No. 2AbstractPDF (426 KB)Minimal spanning trees in undirected networks with exponentially distributed arc weightsNetworks, Vol. 18, No. 2 Cross Ref Volume 29, Issue 1| 1985Theory of Probability & Its Applications History Submitted:28 February 1981Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1129016Article page range:pp. 134-141ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics