Table of contents.

[saga.git] / dyn.tex

diff --git a/dyn.tex b/dyn.tex
index 302425656cd02273ce3b65ac7c7edca6ba1df913..41a5e2de52da9cd1962aeec65e7fcb5dad9267c9 100644 (file)
--- a/dyn.tex
+++ b/dyn.tex
@@ -515,7 +515,7 @@ to fit our needs, so we omit the details.
 
 %--------------------------------------------------------------------------------
 
-\section{Dynamic MSF}
+\section{Dynamic spanning forests}
 
 Let us turn our attention back to the dynamic MSF now.
 Most of the early algorithms for dynamic connectivity also imply $\O(n^\varepsilon)$