Unify references to King's papers.

diff --git a/adv.tex b/adv.tex
index abf07c0eb16a1eccdd8280ff91f076658ec2f224..604f6b1d7c39a513c50817eef90e1f5b78f7ebc3 100644 (file)
--- 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.