Remark on backtracking.

diff --git a/dyn.tex b/dyn.tex
index 502f618eedbed8667013e091250787056db9ebb2..279cfb30e7acdd8965ce02c95c1f92a0523df0df 100644 (file)
--- a/dyn.tex
+++ b/dyn.tex
@@ -168,10 +168,20 @@ Every \<Insert> performs $\O(1)$ operations on the Link-Cut forest, which take
 $\O(\log n)$ each by Theorem \ref{sletar}.
 \qed
 
+\rem
+We can easily extend the semidynamic MSF algorithm to allow an~operation commonly called
+\<Backtrack> --- removal of the most recently inserted edge. It is sufficient to keep the
+history of MSF changes in a~stack and reverse the most recent change upon backtrack.
+
+What are the obstacles to making the structure fully dynamic?
+Deletion of edges that do not belong to the MSF is trivial (we do not
+need to change anything) and so is deletion of bridges (we just remove the bridge
+from the Link-Cut tree, knowing that there is no edge to replace it). The hard part
+is the search for replacement edges after an~edge of the MSF is deleted.
 
 %--------------------------------------------------------------------------------
 
-\section{ET trees}
+\section{Eulerian Tour trees}
 
 
 \endpart