Plan.

diff --git a/PLAN b/PLAN
index 1f8807dcc48446a20e3e366fb6ee20f8ef038c9d..9e1cb1062ca307ff710d14a369a9cb4e3ae1aab4 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -43,6 +43,9 @@
 
 TODO:
 
+Spanning trees:
+
+- prove the density bound
 - fix proof of the local contraction alg
 - cite Eisner's tutorial \cite{eisner:tutorial}
 - \cite{pettie:onlineverify} online lower bound
@@ -52,14 +55,18 @@ TODO:
 - mention disconnected graphs
 - Euclidean MST
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- mention in-place radix-sorting?
-- ranking of permutations on general sets, relationship with integer sorting
 - reference to mixed Boruvka-Jarnik
+
+Models:
+
 - bit tricks: reference to HAKMEM
+- mention in-place radix-sorting?
 
 Ranking:
 
 - the general perspective: is it only a technical trick?
+- move description of the ranking set to the chapter on models?
+- ranking of permutations on general sets, relationship with integer sorting
 
 Notation: