From: Martin Mares <mj@ucw.cz>
Date: Fri, 7 Mar 2008 21:35:22 +0000 (+0100)
Subject: Some more...
X-Git-Tag: printed~182
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=04d70645d31ed008c97bb20c0b6c2d5fc6ad28a7;p=saga.git

Some more...
---

diff --git a/PLAN b/PLAN
index 40a1092..0bd1e98 100644
--- a/PLAN
+++ b/PLAN
@@ -57,6 +57,7 @@ Spanning trees:
 - parallel algorithms: p243-cole (are there others?)
 - bounded expansion classes?
 - restricted cases and arborescences
+- verify: mention our simplifications
 
 Models:
 
diff --git a/adv.tex b/adv.tex
index dde5acb..b5c433b 100644
--- a/adv.tex
+++ b/adv.tex
@@ -783,10 +783,14 @@ of query paths in~$T$ (these are exactly the paths covered by the edges
 of $G\setminus T$). We use the reduction from Lemma \ref{verbranch} to get
 an~equivalent problem with a~full branching tree and a~set of parent-descendant
 paths. Then we run the \<FindHeavy> procedure (\ref{findheavy}) to find
-the heaviest edges and employ Lemma \ref{vercompares} to bound the number
+the heaviest edges and we employ Lemma \ref{vercompares} to bound the number
 of comparisons used.
 \qed
 
+\para
+We will now show an~efficient implementation of \<FindHeavy>, which will
+run in linear time on the RAM.
+