X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=pref.tex;h=cdff6b455e030e26f8a6853493ae42544b60e60d;hb=2ff2b6ced7ae4b31aa7232695c675798f0c73b26;hp=dfb726e3b06ca1fa5791ebe5d784cee1be5aef5c;hpb=3cb8fbfbb3abf47365b3aa24fd913dd2c3559caf;p=saga.git

diff --git a/pref.tex b/pref.tex
index dfb726e..cdff6b4 100644
--- a/pref.tex
+++ b/pref.tex
@@ -21,7 +21,7 @@ ones, and last, but not least filling in important details where the original
 authors have missed some.
 
 When compared with the earlier surveys on the minimum spanning trees, most
-notably Graham and Hell \cite{gh:history} and Eisner \cite{eisner:tutorial},
+notably Graham and Hell \cite{graham:msthistory} and Eisner \cite{eisner:tutorial},
 this work adds many of the recent advances, the dynamic algorithms and
 also the relationship with computational models. No previous work covering
 the ranking problems in their entirety is known.
@@ -39,7 +39,7 @@ included in the textbook \cite{mm:ga} which I have written for this course.
 \:The tree isomorphism algorithm in Section \ref{bucketsort}. Not published yet.
 \:Both algorithms for minor-closed graph classes in Section \ref{minorclosed}. Published in \cite{mm:mst}.
 \:The linear-time verification algorithm in Section \ref{verifysect} is a~simplification
-  of the algorithm of King \cite{king:verify} and it corrects many omissions
+  of the algorithm of King \cite{king:verifytwo} and it corrects many omissions
   in the original paper. Not published yet.
 \:The ranking algorithms in Sections \ref{ranksect} to \ref{kpranksect} are results of joint research with Milan Straka.
   Published in \cite{mm:rank}.