\begin{thebibliography}{10}

\bibitem{boruuvka1926a}
O.~Borůvka.
\newblock O jist{\'e}m probl{\'e}mu minim{\'a}ln{\'\i}m.
\newblock {\em Práce mor. přírodověd. spol. v Brně III}, 3:37--58, 1926.

\bibitem{boruuvka1926b}
O.~Borůvka.
\newblock P{\v{r}}{\'\i}sp{\v{e}}vek k {\v{r}}e{\v{s}}en{\'\i} ot{\'a}zky
  ekonomick{\'e} stavby elektrovodn{\'\i}ch s{\'\i}t{\'\i}.
\newblock {\em Elektrotechnick{\`y} obzor}, 15:153--154, 1926.

\bibitem{chan1998}
T.~M. Chan.
\newblock Backwards analysis of the {K}arger-{K}lein-{T}arjan algorithm for
  minimum spanning.
\newblock {\em Inf. Process. Lett.}, 67(6):303--304, 1998.

\bibitem{clrs2009}
T.~H. Cormen, C.~E. Leiserson, R.~L. Rivest, and C.~Stein.
\newblock {\em Introduction to Algorithms, Third Edition}.
\newblock The MIT Press, 3rd edition, 2009.

\bibitem{dijkstra1959}
E.~Dijkstra.
\newblock A note on two problems in connexion with graphs.
\newblock {\em Numerische Mathematik}, 1(1):269--271, 1959.

\bibitem{dixon1992}
B.~Dixon, M.~Rauch, and R.~Tarjan.
\newblock Verification and sensitivity analysis of minimum spanning trees in
  linear time.
\newblock {\em SIAM Journal on Computing}, 21(6):1184--1192, 1992.

\bibitem{hagerup2010}
T.~Hagerup.
\newblock An even simpler linear-time algorithm for verifying minimum spanning
  trees.
\newblock In C.~Paul and M.~Habib, editors, {\em Graph-Theoretic Concepts in
  Computer Science}, volume 5911 of {\em Lecture Notes in Computer Science},
  pages 178--189. Springer Berlin Heidelberg, 2010.

\bibitem{harel1980}
D.~Harel.
\newblock A linear time algorithm for the lowest common ancestors problem.
\newblock In {\em Foundations of Computer Science, 1980., 21st Annual Symposium
  on}, pages 308--319, 1980.

\bibitem{harel1984}
D.~Harel and R.~Tarjan.
\newblock Fast algorithms for finding nearest common ancestors.
\newblock {\em SIAM Journal on Computing}, 13(2):338--355, 1984.

\bibitem{karger1995}
D.~R. Karger, P.~N. Klein, and R.~E. Tarjan.
\newblock A randomized linear-time algorithm to find minimum spanning trees.
\newblock {\em J. ACM}, 42(2):321--328, Mar. 1995.

\bibitem{king1995}
V.~King.
\newblock A simpler minimum spanning tree verification algorithm.
\newblock In S.~Akl, F.~Dehne, J.-R. Sack, and N.~Santoro, editors, {\em
  Algorithms and Data Structures}, volume 955 of {\em Lecture Notes in Computer
  Science}, pages 440--448. Springer Berlin Heidelberg, 1995.

\bibitem{king1997}
V.~King.
\newblock A simpler minimum spanning tree verification algorithm.
\newblock {\em Algorithmica}, 18(2):263--270, 1997.

\bibitem{klein1994}
P.~N. Klein and R.~E. Tarjan.
\newblock A randomized linear-time algorithm for finding minimum spanning
  trees.
\newblock In {\em Proceedings of the twenty-sixth annual ACM symposium on
  Theory of computing}, STOC '94, pages 9--15, New York, NY, USA, 1994. ACM.

\bibitem{komlos1984}
J.~Komlos.
\newblock Linear verification for spanning trees.
\newblock In {\em Foundations of Computer Science, 1984. 25th Annual Symposium
  on}, pages 201--206, 1984.

\bibitem{komlos1985}
J.~Komlós.
\newblock Linear verification for spanning trees.
\newblock {\em Combinatorica}, 5(1):57--65, 1985.

\bibitem{motwani1995}
R.~Motwani and P.~Raghavan.
\newblock {\em Randomized algorithms}.
\newblock Cambridge University Press, New York, NY, USA, 1995.

\bibitem{nesetril2001}
J.~Nešetřil, E.~Milková, and H.~Nešetřilová.
\newblock Otakar borůvka on minimum spanning tree problem translation of both
  the 1926 papers, comments, history.
\newblock {\em Discrete Mathematics}, 233(1–3):3 -- 36, 2001.
\newblock <ce:title>Czech and Slovak 2</ce:title>.

\bibitem{schieber1988}
B.~Schieber and U.~Vishkin.
\newblock On finding lowest common ancestors: Simplification and
  parallelization.
\newblock In J.~Reif, editor, {\em VLSI Algorithms and Architectures}, volume
  319 of {\em Lecture Notes in Computer Science}, pages 111--123. Springer New
  York, 1988.

\bibitem{tarjan1983}
R.~Tarjan.
\newblock {\em Data Structures and Network Algorithms}, volume~44, chapter 6.
  Minimum Spanning Trees, pages 71--83.
\newblock SIAM, 1983.

\bibitem{tarjan1975}
R.~E. Tarjan.
\newblock Efficiency of a good but not linear set union algorithm.
\newblock {\em J. ACM}, 22(2):215--225, Apr. 1975.

\bibitem{tarjan1979}
R.~E. Tarjan.
\newblock Applications of path compression on balanced trees.
\newblock {\em J. ACM}, 26(4):690--715, Oct. 1979.

\end{thebibliography}