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.
\itemize\ibull
\:The lower bound in Section \ref{contalg}. Not published yet.
\: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}.
+\:One of the 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}.