X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=PLAN;h=900e7bd72a4bafd6b3414297ceb6c5e70feb6b0c;hb=6659c33a805c0e22c969a45480c068d5d7ddf471;hp=2c44db977b18690b71462343a8195a71b1ea6c3d;hpb=12e0112fbab389a8aa78abbfedb763afe0e27f1d;p=saga.git

diff --git a/PLAN b/PLAN
index 2c44db9..900e7bd 100644
--- a/PLAN
+++ b/PLAN
@@ -35,6 +35,7 @@
   o  ET-trees
   o  Fully dynamic connectivity
   o  Dynamic MST
+  o  Almost minimum trees
 
 *  Ranking Combinatorial Objects
 
@@ -43,42 +44,13 @@
   o  Ranking of k-permutations
   o  Restricted permutations
   o  Hatcheck lady and other derangements
-  .  ?? other objects ??
-  .  ?? general perspective ??
 
 TODO:
 
-Spanning trees:
-
-- cite Eisner's tutorial \cite{eisner:tutorial}
-- move the remark on disconnected graphs? separate section?
-- mention graphs with non-unique weights? also in the separate section?
-- Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- citation of mixed Boruvka-Jarnik
-- use the notation for contraction by a set
-- mention bugs in Valeria's verification paper
-- more references on decision trees
-- rename theorem on Minimality by order
-- introduce Cut rule and Cycle rule earlier
-- Lemma: deletion of a non-MST edge does not alter the MST
-- use the name "Boruvka step"
-
-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
+Applications:
+
 - degree-restricted cases and arborescences
 - bounded expansion classes?
-- mention matroids
-
-Models:
-
-- bit tricks: reference to HAKMEM
-- add more context from thorup:aczero, also mention FP operations
-- Tarjan79 is mentioned by Pettie to define Pointer machines
-- add references to the C language
-- PM: unify yardsticks
-- all data structures should mention space complexity
 
 Ranking:
 
@@ -90,22 +62,12 @@ Ranking:
   co je to vlastne za matice co splnuji 4.5.2
 - JN: bounded-degree restriction graphs; would it imply general speedup?
 
-Notation:
-
-- G has to be connected, so m=O(n)
-- 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?
-- introduce \widehat\O early
-
 Typography:
 
-- formatting of multi-line \algin, \algout
-- use calligraphic letters from ams?
+* formatting of multi-line \algin, \algout
 
 Global:
 
-- Intro: cite GA booklet
 - each chapter should make clear in which model we work
 - clean up bibliography
+- intro: \log is binary