Replanning.

diff --git a/PLAN b/PLAN
index 050f0ea2b036a330c2a7015b3107b11de97530a6..02e8af206f40fa59ae90008cb53e7dcadd05a20b 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -31,7 +31,7 @@
 
 *  Dynamic MST algorithms
 
-  .  (Semi-)dynamic algorithms
+  o  (Semi-)dynamic algorithms
   .  ET-trees
   .  Fully dynamic connectivity
   .  Dynamic MST
@@ -52,20 +52,23 @@ Spanning trees:
 
 - cite Eisner's tutorial \cite{eisner:tutorial}
 - \cite{pettie:onlineverify} online lower bound
-- mention matroids
 - move the remark on disconnected graphs? separate section?
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
 - reference to mixed Boruvka-Jarnik
 - use the notation for contraction by a set
-- practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
-- parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
-- bounded expansion classes?
-- degree-restricted cases and arborescences
-- random sampling (propp:randommst)
 - mention bugs in Valeria's verification paper
 - more references on decision trees
 - rename theorem on Minimality by order
 
+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
+- random sampling (propp:randommst)
+- degree-restricted cases and arborescences
+- bounded expansion classes?
+- mention matroids
+
 Models:
 
 - bit tricks: reference to HAKMEM