Otakar Borůvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history

Discrete Mathematics

Volumn 233, Issue 1-3, 2001, Pages 3-36

  Nešetřil, Jaroslav ^a   Milková, Eva ^a   Nešetřilová, Helena ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035962186     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00224-7     Document Type: Article

References (51)

1. O. Borůvka, O jistém problému minimálním (About a certain minimal problem), Práce mor. přírodově d. spol. v Brně III (3) (1926) 37-58 (Czech, German summary).
2. O. Borůvka, Příspěvek k řešeni otázky ekonomické stavby elektrovodních sítí (Contribution to the solution of a problem of economical construction of electrical networks), Elektronický obzor 15 (1926) 153-154.
3. O. Borůvka, Some recolection of a mathematical life in Brno. Pokroky matematiky, fyziky a astronomie, XVII (1972) 130-134 (in Czech).
4. O. Borůvka, Personal communications and discussions with J. Nešetřil. (around 1980).
5. T.M. Chan, Backwards analysis ot the Karger-Klein-Tarjan algorithm for minimum spanning trees, Inform. Process. Lett. 67 (1998) 303-304.
6. B. Chazelle, A faster deterministic algorithm for minimum spanning trees, Proceedings of Thirty-Eight Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1997, pp. 22-31.
7. B. Chazelle, Car-pooling as a data structuring device: the soft heap, Proceedings of Sixth Annual European Symposium on Algorithms (ESA), 1998, pp. 35-42.
8. B. Chazelle, A minimum spanning tree algorithm with inverse- Ackerman type complexity, J. ACM, to appear.
9. B. Chazelle, Priority queue with optimal error rate, J. ACM, to appear.
10. R. Cole, P.N. Klein, R.E. Tarjan, A linear-work parallel algorithm for finding minimum spanning trees, Proceedings of SPAA, 1994.
11. K. Čulík, K jednomu minimálnímu problému O. Borůvky Časopis pro pěstování Mat. 85 (1960) 93-94.
12. K. Culík, V. Dolež al, M. Fiedler, Kombinatorická analýza v praxi, SNTL, Prague, 1967.
13. G. Dantzing, Discrete variable extremum problems, Oper. Res. 5 (1957).
14. E.W. Dijkstra, Some theorems on spanning subtrees of a graph, Indag. Math. XXII (2) (1960) 196-199.
15. B. Dixon, M. Rauch, R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM J. Comput. 21 (6) (1992) 1184-1192.
16. M. Duchamp, a l'infinitif (typotranslation by R. Hamilton et al.), The Typosophic Society, Northend, 1999.
17. J. Edmonds, Optimum branchings, J. Res. Natl. Bur. Stand. 71B (1967) 233-240.
18. M. Fredman, R.E. Tarjan, Fibonacci heaps and their uses in network optimization algorithms. Proceedings of 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 338-346.
19. M. Fredman, D.E. Willard, Trans- dichotomous algorithms for minimum spanning trees and shortest paths. Proceedings of 31st Annual IEEE Symposium on Foundations of Computer Science, 1966, pp. 719-725.
20. H.N. Gabov, Z. Galil, T.H. Spencer, Efficient implementation of graph algorithms using contraction, Proceedings of 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 347-357.
21. H.N. Gabov, Z. Galil, T.H. Spencer, R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica 6 (1986) 109-122.
22. R.L. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, North-Holland, Amsterdam, 1995.
23. R.L. Graham, P. Hell, On the history of the minimum spanning tree problem, Ann. History Comput. 7 (1985) 43-57.
24. V. Jarník, O jistém problému minimálním, Práce mor. přírodověd. spol. v Brně VI (4) (1930) 57-63.
25. V. Jarník, M. Kössler, O minimálních grafech obsahujících n daný ch bodů, Čas. pro pě̈stování matematiky 63 (1934) 223-235.
26. R. Kalaba, On some communication network problem, Proceedings of Symposium on Applied Mathematics, 1960, pp. 261-280.
27. D.R. Karger, Random sampling in matroids, with applications to graph connectivity and minimum spanning trees, Proceedings of 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 84-93.
28. D. Karger, P.N. Klein, R.E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. Assoc. Comput. Mach. 42 (1995) 321-328.
29. V. King, A simpler minimum spanning tree verification algorithm, manuscript, 1993.
30. P.N. Klein, R.E. Tarjan, A randomized linear-time algorithm for finding minimum spanning trees, Proceedings of 26th Annual ACM Symposium on theory of Computing, 1994, pp. 9-15.
31. J. Komlós, Linear verification for spanning trees, Combinatorica 5 (1985) 57-65.
32. B. Korte, L. Lovász, R. Schrader, Greedoids, Springer, Berlin, 1991.
33. B. Korte, J. Nešetřil, Vojtěch Jarník's work in combinatorial optimization, this volume.
34. A. Kotzig, Súvislé grafy s minimálnou hodnotou v konečnom súvislom grafe, Časopis pro pěst. Mat. (1961) 1-6.
35. J.B. Kruskal, On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48-50.
36. J.B. Kruskal, A reminiscence about shortest spanning subtrees, Arch. Math. 33 (1-2) (1997) 13-14.
37. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1993.
38. J. Lukasiewicz, K. Florek, J. Perkal, H. Steinhaus, S. Zubrzycky, Sur la liaison et la division des points d'un ensemble fini, Math. 2 (1949-1951) 282-285.
39. J. Malina (Ed.), Otakar Borůvka, Universitas Masarykiana, Brno, 1996.
40. J. Matoušek, J. Nešetřil, Invitation to Discrete Mathematics, Oxford University Press, Oxford, 1998.
41. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995.
42. J. Nešetřil, Some remarks on the history of MST- problem, Arch. Math. 33 (1997) 15-22.
43. R.C. Prim, The shortest connecting network and some generalizations, Bell. Systems Tech. J. 36 (1957) 1389-1401.
44. L. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
45. E.W. Solomon, A comprehensive program for network problems, Comput. J. 3 (1960) 89-97.
46. R.E. Tarjan, Applications of path compressions on balanced trees, J. Assoc. Comput. Math. 26 (1979) 690-715.
47. R.E. Tarjan, Data structures and network algorithms. CBMS- NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983.
48. B.L. Van den Waerden, Modern Algebra, Springer, Berlin, 1931.
49. H. Whitney, On the abstract properties of linear dependence, Amer. J. Math. 57 (1935) 509-533.
50. A. Yao, An O(|E|log log|V|) algorithm for finding minimum spanning trees, Inform. Process. Lett. 4 (1975) 21-23.
51. Arch. Math, (a special Borůvka issue) 33 (1997) 1-2.