Moved the Gustedt remark to Applications.

diff --git a/adv.tex b/adv.tex
index 2a81be339ee37a25dc2d122741ec139154d641b4..f0370bb0e4e71a476542fd2ffc5b7375ce1c3a9c 100644 (file)
--- a/adv.tex
+++ b/adv.tex
@@ -255,11 +255,6 @@ has degree~9.
 
 \figure{hexangle.eps}{\epsfxsize}{The construction from Remark~\ref{hexa}}
 
-\rem
-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
 The bound on the average degree needed to enforce a~$K_k$ minor, which we get from Theorem \ref{maderthm},
 is very coarse. Kostochka \cite{kostochka:lbh} and independently Thomason \cite{thomason:efc}

diff --git a/appl.tex b/appl.tex
index f9d59ab811f3b882a21ea55de4c806c207036047..0b1b302ec84cefa0148ac3686881321f0cfab8c9 100644 (file)
--- a/appl.tex
+++ b/appl.tex
@@ -197,4 +197,9 @@ with linear work can be obtained by utilizing randomness, as shown for example
 by Pettie and Ramachandran \cite{pettie:minirand}, but so far only at the
 expense of higher time complexity.
 
+Some of the algorithms for special classes of graphs also have their counterparts
+in the parallel world. Most notably the Contractive Bor\o{u}vka's algorithm
+for minor-closed graph classes (Theorem \ref{mstmcc}) has been parallized
+by Gustedt \cite{gustedt:parallel}.
+
 \endpart