From: Martin Mares <mj@ucw.cz>
Date: Fri, 11 Apr 2008 13:09:48 +0000 (+0200)
Subject: Unify references to King's papers.
X-Git-Tag: printed~101
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=c9363caaf874f216e2c29d8d42f324e0d288647a;p=saga.git

Unify references to King's papers.
---

diff --git a/adv.tex b/adv.tex
index abf07c0..604f6b1 100644
--- a/adv.tex
+++ b/adv.tex
@@ -797,7 +797,7 @@ in time $\O(mn\log n)$.
 We have proven that $\O(m)$ edge weight comparisons suffice to verify minimality
 of a~given spanning tree. Now we will show an~algorithm for the RAM,
 which finds the required comparisons in linear time. We will follow the idea
-of King from \cite{king:verify}, but as we have the power of the RAM data structures
+of King from \cite{king:verifytwo}, but as we have the power of the RAM data structures
 from Section~\ref{bitsect} at our command, the low-level details will be easier,
 especially the construction of vertex and edge labels.