Random Minimal Trees
From MaRDI portal
Publication:5536040
DOI10.1137/0113021zbMATH Open0156.19102OpenAlexW2017995040MaRDI QIDQ5536040FDOQ5536040
Authors: E. N. Gilbert 
Publication date: 1965
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0113021
Cited In (6)
- Fast heuristic algorithms for rectilinear Steiner trees
- On properties of geometric random problems in the plane
- Rate of convergence for the Euclidean minimum spanning tree limit law
- Title not available (Why is that?)
- The relative neighbourhood graph of a finite planar set
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
This page was built for publication: Random Minimal Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536040)
