Cover of the abstract.

[saga.git] / mst.tex

diff --git a/mst.tex b/mst.tex
index 9729a06167e56c6e3402589f30df6cff9d23bf26..5cccbb9810448adefd7980aa99b52adcebc11ac5 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -481,7 +481,7 @@ From this, we can conclude:
 The Jarn\'\i{}k's algorithm computes the MST of a~given graph in time $\O(m\log n)$.
 
 \rem
-We will show several faster implementations in section \ref{iteralg}.
+We will show several faster implementations in Section \ref{iteralg}.
 
 \paran{Kruskal's algorithm}%
 The last of the three classical algorithms processes the edges of the