Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bingham, N. H.
1989.
Probability Measures on Groups IX.
Vol. 1379,
Issue. ,
p.
6.
Steele, J. Michael
1992.
Euclidean semi-matchings of random samples.
Mathematical Programming,
Vol. 53,
Issue. 1-3,
p.
127.
Aldous, David
and
Steele, J. Michael
1992.
Asymptotics for Euclidean minimal spanning trees on random points.
Probability Theory and Related Fields,
Vol. 92,
Issue. 2,
p.
247.
Jaillet, Patrick
1995.
On properties of geometric random problems in the plane.
Annals of Operations Research,
Vol. 61,
Issue. 1,
p.
1.
Penrose, Mathew D.
1996.
The random minimal spanning tree in high dimensions.
The Annals of Probability,
Vol. 24,
Issue. 4,
Lee, Sungchul
1997.
The central limit theorem for Euclidean minimal spanning trees I I.
The Annals of Applied Probability,
Vol. 7,
Issue. 4,
Small, Christopher G.
1997.
Multidimensional medians arising from geodesics on graphs.
The Annals of Statistics,
Vol. 25,
Issue. 2,
Henze, Norbert
and
Penrose, Mathew D.
1999.
On the multivariate runs test.
The Annals of Statistics,
Vol. 27,
Issue. 1,
Lee, Sungchul
1999.
The central limit theorem for Euclidean minimal spanning trees II.
Advances in Applied Probability,
Vol. 31,
Issue. 4,
p.
969.
Willemain, Thomas R.
and
Bennett, Mihoko V.
2002.
The Distribution of Node Degree in Maximum Spanning Trees.
Journal of Statistical Computation and Simulation,
Vol. 72,
Issue. 2,
p.
101.
Kim, Jeong Han
and
Lee, Sungchul
2003.
Tail bound for the minimal spanning tree of a complete graph.
Statistics & Probability Letters,
Vol. 64,
Issue. 4,
p.
425.
Penrose, Mathew D.
and
Yukich, J. E.
2003.
Weak laws of large numbers in geometric probability.
The Annals of Applied Probability,
Vol. 13,
Issue. 1,
Brito, María R.
and
Quiroz, Adolfo J.
2005.
Degree Frequencies in the Minimal Spanning Tree and Dimension Identification.
Communications in Statistics - Theory and Methods,
Vol. 33,
Issue. 1,
p.
99.
He, Jing
Zhang, Yanchun
Huang, Guangyan
and
Shi, Yong
2007.
Network Lifetime of Application-Specific Randomly Deployed Wireless Sensor Networks in Arbitrary Sensor Density.
p.
352.
LEZORAY, O.
MEURIE, C.
and
ELMOATAZ, A.
2008.
GRAPH-BASED ORDERING SCHEME FOR COLOR IMAGE FILTERING.
International Journal of Image and Graphics,
Vol. 08,
Issue. 03,
p.
473.
Cuntz, Hermann
Mathy, Alexandre
and
Häusser, Michael
2012.
A scaling law derived from optimal dendritic wiring.
Proceedings of the National Academy of Sciences,
Vol. 109,
Issue. 27,
p.
11014.
Cuntz, Hermann
2014.
The Computing Dendrite.
Vol. 11,
Issue. ,
p.
91.
Gan, Siew Lee
and
Djauhari, Maman Abdurachman
2015.
New York Stock Exchange performance: evidence from the forest of multidimensional minimum spanning trees.
Journal of Statistical Mechanics: Theory and Experiment,
Vol. 2015,
Issue. 12,
p.
P12005.
Campadelli, P.
Casiraghi, E.
Ceruti, C.
and
Rozza, A.
2015.
Intrinsic Dimension Estimation: Relevant Techniques and a Benchmark Framework.
Mathematical Problems in Engineering,
Vol. 2015,
Issue. ,
p.
1.
Andersen, Patrick J.
and
Ras, Charl J.
2019.
Algorithms for Euclidean Degree Bounded Spanning Tree Problems.
International Journal of Computational Geometry & Applications,
Vol. 29,
Issue. 02,
p.
121.