In the definiton of the soft queue, we should better explicitly mention that

[saga.git] / adv.tex

diff --git a/adv.tex b/adv.tex
index 35d5d9b685a558f1bd8d9c627ccdff3c88d7981f..2a81be339ee37a25dc2d122741ec139154d641b4 100644 (file)
--- a/adv.tex
+++ b/adv.tex
@@ -125,7 +125,7 @@ $G$~would contain a~subdivision of~$K_x$ and hence $K_x$ as a~minor.
 
 Let us return to the analysis of our algorithm.
 
-\thmn{MST on minor-closed classes, Mare\v{s} \cite{mm:mst}}\id{mstmcc}%
+\thmn{MST on minor-closed classes, Tarjan \cite{tarjan:dsna}}\id{mstmcc}%
 For any fixed non-trivial minor-closed class~$\cal C$ of graphs, the Contractive Bor\o{u}vka's
 algorithm (\ref{contbor}) finds the MST of any graph of this class in time
 $\O(n)$. (The constant hidden in the~$\O$ depends on the class.)
@@ -256,8 +256,8 @@ has degree~9.
 \figure{hexangle.eps}{\epsfxsize}{The construction from Remark~\ref{hexa}}
 
 \rem
-The observation in~Theorem~\ref{mstmcc} was also independently made by Gustedt \cite{gustedt:parallel},
-who studied a~parallel version of the Contractive Bor\o{u}vka's algorithm applied
+The observation in~Theorem~\ref{mstmcc} was also used by Gustedt \cite{gustedt:parallel},
+to construct parallel version of the Contractive Bor\o{u}vka's algorithm applied
 to minor-closed classes.
 
 \rem