Random Minimal Trees

From MaRDI portal

Revision as of 03:25, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5536040

Jump to:navigation, search

DOI10.1137/0113021zbMath0156.19102OpenAlexW2017995040MaRDI QIDQ5536040

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

zbMATH Keywords

operations research

Related Items (6)

On properties of geometric random problems in the plane ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ The relative neighbourhood graph of a finite planar set ⋮ Unnamed Item ⋮ An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability ⋮ Rate of convergence for the Euclidean minimum spanning tree limit law

This page was built for publication: Random Minimal Trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5536040&oldid=30130862"