Practical and parallel algorithms.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 41930d069e731a846e0d6faa45c951c313c4d0e4..81d21f3c83268e461eef7a64ef68bae08a8e5f08 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -60,13 +60,9 @@ Spanning trees:
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
 - use the notation for contraction by a set
 - mention bugs in Valeria's verification paper
-- more references on decision trees
-- Lemma: deletion of a non-MST edge does not alter the MST
-- mention that there are only a few algorithms based on the Red rule
+* Lemma: deletion of a non-MST edge does not alter the MST
 
 Related:
-- practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
-- parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
 - K best trees
 - degree-restricted cases and arborescences
 - bounded expansion classes?
@@ -86,10 +82,10 @@ Notation:
 
 - sort the table
 - G has to be connected, so m=O(n)
-- impedance mismatch in terminology: contraction of G along e vs. contraction of e.
+* impedance mismatch in terminology: contraction of G along e vs. contraction of e.
 - use \delta(X) notation
 - unify use of n(G) vs. n
-- change the notation for contractions -- use double slash instead of the dot?
+* change the notation for contractions -- use double slash instead of the dot?
 - introduce \widehat\O early
 
 Typography: