References to better bounds for enforced minors.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 02e8af206f40fa59ae90008cb53e7dcadd05a20b..900e7bd72a4bafd6b3414297ceb6c5e70feb6b0c 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -32,9 +32,10 @@
 *  Dynamic MST algorithms
 
   o  (Semi-)dynamic algorithms
-  .  ET-trees
-  .  Fully dynamic connectivity
-  .  Dynamic MST
+  o  ET-trees
+  o  Fully dynamic connectivity
+  o  Dynamic MST
+  o  Almost minimum trees
 
 *  Ranking Combinatorial Objects
 
@@ -43,45 +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}
-- \cite{pettie:onlineverify} online lower bound
-- 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
-- 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)
+Applications:
+
 - degree-restricted cases and arborescences
 - bounded expansion classes?
-- mention matroids
-
-Models:
-
-- bit tricks: reference to HAKMEM
-- mention in-place radix-sorting?
-- consequences of Q-Heaps: Thorup's undirected SSSP etc.
-- 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
-
-Dynamic:
-
-- What is the origin of the semidynamic MSF?
 
 Ranking:
 
@@ -90,24 +59,15 @@ Ranking:
 - JN: explain approx scheme
 - JN: 4.5.1:  neslo by preci isolovat nejaky vlstnosti restriction matrices
   tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
-  co je to vlstne za matice co splnuji 4.5.2
+  co je to vlastne za matice co splnuji 4.5.2
 - JN: bounded-degree restriction graphs; would it imply general speedup?
 
-Notation:
+Typography:
 
-- 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
-- use calligraphic letters from ams?
-- change the notation for contractions -- use double slash instead of the dot?
-- introduce \widehat\O early
-- unify { x ; ... }, { x | ...} and { x : ... }
-- capitalize Pointer Machine
-- Ackermann: which of the Tarjan's set union papers should we cite?
-- Ackermann function vs. Ackermann's function
+* formatting of multi-line \algin, \algout
 
-Varia:
+Global:
 
-- cite GA booklet
-- minimize the use of Remarks, use \paran instead
+- each chapter should make clear in which model we work
+- clean up bibliography
+- intro: \log is binary