Otakar boruvka biography templates pdf

To learn more, view our Privacy Policy. To browse Academia. This is followed by the survey of development related to the MST problem and by remarks and historical perspective.

Professor Otakar Boruvka, a nestor and legend among Brno math ematicians, for decades one of the leading figures in the world of.

All rights reserved. The minimum spanning tree is a problem which has become fairly popular among mathematicians after the Second World War. However, already before the War, before the graph-theoretical terminology that is now used in connection with this problem was developed, there existed algorithms for solving this problem. This article discusses mutual relationships between solutions to some known problems.

Secondly, the basic differences between the three classical solutions to the MST problem are discussed.

Otakar Borůvka: A Short Biography.

It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal and Prim as the sources of the problem and its first efficient solutions, despite the citation by both of Borbvka as a predecessor. In fact, there are several apparently independent sources and algorithmic solutions of the problem.

They have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century. We shall explore and compare these works and their motivations, and relate them to the most recent advances on the minimum spanning tree problem. It deals with finding the spanning tree of an undirected, connected graph, such that the sum of the weights of the selected edges is minimum.

MSTP has direct applications in the design of computer and communication networks, power lines, telephone networks, wiring connections, links in a transportation network, piping, etc. It also occurs as a sub problem in the solution of other problems like approximation algorithms for the travelling salesman problem, the matching problem and the capacitated MST problem.