|
|
|
|
Литература
|
|
| |
| 1. |
Иванов А. О., Никонов И. М., Тужилин А. А., “Множества, допускающие соединение графами конечной длины”, Мат. сб., 196:6 (2005), 71–110      |
| 2. |
Aldous D., Steele J. M., “Asymptotics for Euclidean minimal spanning trees on random points”, Probab. Theory Relat. Fields, 92 (1992), 247–258  |
| 3. |
Alexander K. S., “Percolation and minimal spanning forests in infinite graphs”, Ann. Probab., 23:1 (1995), 87–104 |
| 4. |
Borůvka O., “O jistém problému minimálním”, Práce Mor. Prírodoved. Spol. v Brne (Acta Soc. Sci. Nat. Moravicae), 3 (1926), 37–58 |
| 5. |
Ivanov A., Tuzhilin A., “The Steiner ratio Gilbert–Pollak conjecture is still open”, Algorithmica, 62:1–2 (2012), 630–632 |
| 6. |
Preparata F. P., Shamos M. I., Computational Geometry, an Introduction, Springer, Berlin, 1985 |
| 7. |
Shamos M. I., Computational Geometry, Ph. D. Thesis, Yale Univ., 1978 |
| 8. |
Smith W. D., Smith J. M., “On the Steiner ratio in $3$-space”, J. Combin. Theory A, 65 (1995), 301–322 |
