From: Martin Mares <mj@ucw.cz>
Date: Mon, 16 Jun 2008 10:50:49 +0000 (+0200)
Subject: Fixed missing ref.
X-Git-Tag: phd-final~3
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=2ff2b6ced7ae4b31aa7232695c675798f0c73b26;p=saga.git

Fixed missing ref.
---

diff --git a/abstract.tex b/abstract.tex
index 12f2e61..7c67936 100644
--- a/abstract.tex
+++ b/abstract.tex
@@ -756,7 +756,7 @@ We will describe the algorithm as a~recursive procedure:
   a~collection~$\C=\{C_1,\ldots,C_k\}$ of clusters and a~set~$R^\C$ of corrupted edges.
 \:$F_i \= \mst(C_i)$ for all~$i$, obtained using optimal decision trees.
 \:$G_A \= (G / \bigcup_i C_i) \setminus R^\C$. \cmt{the contracted graph}
-\:$F_A \= \msf(G_A)$ calculated by the Iterated Jarn\'\i{}k's algorithm (\ref{itjar}).
+\:$F_A \= \msf(G_A)$ calculated by the Iterated Jarn\'\i{}k's algorithm (see Section \ref{iteralg}).
 \:$G_B \= \bigcup_i F_i \cup F_A \cup R^\C$. \cmt{combine subtrees with corrupted edges}
 \:Run two Bor\o{u}vka steps (iterations of the Contractive Bor\o{u}vka's algorithm, \ref{contbor}) on~$G_B$,
   getting a~contracted graph~$G_C$ and a~set~$F_B$ of MST edges.