section -> Section (fix remaining).

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

diff --git a/ram.tex b/ram.tex
index c3fcf1f225d04bae82bbe16417319e2a32f01de2..bbf9cd984535822a170440baf6cea731d467edce 100644 (file)
--- a/ram.tex
+++ b/ram.tex
@@ -1210,7 +1210,7 @@ Every operation on the Q-heap can be performed in a~constant number of
 vector operations and calculations of ranks. The ranks are computed
 in $\O(1)$ steps involving again $\O(1)$ vector operations, binary
 logarithms and bit extraction. All these can be calculated in constant
-time using the results of section \ref{bitsect} and Lemma \ref{qhxtract}.
+time using the results of Section \ref{bitsect} and Lemma \ref{qhxtract}.
 \qed
 
 \paran{Combining Q-heaps}%

diff --git a/rank.tex b/rank.tex
index b2c9421f680038b983e1865edbbeb02f97bad3b3..8e4c2020353ecb5f4fdc282b26016a6a291b872d 100644 (file)
--- a/rank.tex
+++ b/rank.tex
@@ -580,7 +580,7 @@ use the Kasteleyn's algorithm \cite{kasteleyn:crystals} based on Pfaffian
 orientations which runs in time $\O(n^3)$.
 It has been recently extended to arbitrary surfaces by Yuster and Zwick
 \cite{yuster:matching} and sped up to $\O(n^{2.19})$. The counting problem
-for arbitrary minor-closed classes (cf.~section \ref{minorclosed}) is still
+for arbitrary minor-closed classes (cf.~Section \ref{minorclosed}) is still
 open.
 
 %--------------------------------------------------------------------------------