From be2346beec4fc58ce12daa62022465be3990629d Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Thu, 21 Feb 2008 14:50:44 +0100
Subject: [PATCH] Plan.

---
 PLAN | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/PLAN b/PLAN
index 1f8807d..9e1cb10 100644
--- 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:
 
-- 
2.39.2