Minor improvements.

diff --git a/PLAN b/PLAN
index 643251f35ec4d5cce9216acf832daf3be71d4550..41930d069e731a846e0d6faa45c951c313c4d0e4 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -101,3 +101,7 @@ Global:
 
 - each chapter should make clear in which model we work
 - clean up bibliography
+
+Pictures:
+
+- structure of a Q-heap

diff --git a/adv.tex b/adv.tex
index f9e09380e37948ca225bfaafe021c71c89b9bb80..f9f7f8732c78f6247146fd88eb80a6399db27ccd 100644 (file)
--- a/adv.tex
+++ b/adv.tex
@@ -1032,7 +1032,7 @@ as there are $\O(1)$ query paths per edge, the first sum is $\O(\#\hbox{comparis
 which is $\O(m)$ by Theorem \ref{verify}.
 \qed
 
-\rem\id{pmverify}%
+\paran{Verification on the Pointer Machine}\id{pmverify}%
 Buchsbaum et al.~\cite{buchsbaum:verify} have recently shown that linear-time
 verification can be achieved even on the Pointer Machine. They first solve the
 problem of finding the lowest common ancestors for a~set of pairs of vertices
@@ -1041,7 +1041,7 @@ based on the Disjoint Set Union data structure with the framework of topological
 computations developed in Section \ref{bucketsort}. Then they use a~similar
 technique for finding the peaks themselves.
 
-\rem
+\paran{Online verification}%
 The online version of this problem has turned out to be more difficult. It calls for an~algorithm
 that preprocesses the tree and then answers queries for peaks of paths presented online. Pettie
 \cite{pettie:onlineverify} has proven an~interesting lower bound based on the inverses of the
@@ -1245,7 +1245,7 @@ requires an~unbounded number of random bits in the worst case.
 
 \rem
 The only place where we needed the power of the RAM is finding the heavy edges,
-so we can employ the pointer-machine verification algorithm mentioned in Remark \ref{pmverify}
+so we can employ the pointer-machine verification algorithm mentioned in \ref{pmverify}
 to bring the results of this section to the~PM.
 
 %--------------------------------------------------------------------------------

diff --git a/biblio.bib b/biblio.bib
index 3dead5b6834094149ef2e152504f2d8e4d6f1589..cb317ab12287e5d38c5e3293f66006c8b59d0355 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1483,3 +1483,14 @@
   year={1992},
   publisher={Oxford University Press}
 }
+
+@article{ katoh:kmin,
+  author = {N. Katoh and T. Ibaraki and H. Mine},
+  title = {An Algorithm for Finding $K$ Minimum Spanning Trees},
+  publisher = {SIAM},
+  year = {1981},
+  journal = {SIAM Journal on Computing},
+  volume = {10},
+  number = {2},
+  pages = {247--255},
+}