References to better bounds for enforced minors.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 063200487c77d56de683b2d4fbdbad37b712ac36..900e7bd72a4bafd6b3414297ceb6c5e70feb6b0c 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -35,7 +35,7 @@
   o  ET-trees
   o  Fully dynamic connectivity
   o  Dynamic MST
-  .  Almost minimum trees
+  o  Almost minimum trees
 
 *  Ranking Combinatorial Objects
 
@@ -44,17 +44,13 @@
   o  Ranking of k-permutations
   o  Restricted permutations
   o  Hatcheck lady and other derangements
-  .  ?? other objects ??
-  .  ?? general perspective ??
 
 TODO:
 
 Applications:
 
-- K best trees
 - degree-restricted cases and arborescences
 - bounded expansion classes?
-- finding all MST's
 
 Ranking:
 
@@ -66,19 +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:
-
-- use \delta(X) notation
-- use the notation for contraction by a set
-- unify use of n(G) vs. n
-- introduce \widehat\O early
-
 Typography:
 
 * formatting of multi-line \algin, \algout
-- use calligraphic letters from ams?
 
 Global:
 
 - each chapter should make clear in which model we work
 - clean up bibliography
+- intro: \log is binary