TODO from JN.

diff --git a/PLAN b/PLAN
index 8ea33fa441ec4aeb4e1489b3a810f100ebc1f1b8..865e111a925df5236cec52864524bddbb66d3d25 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -21,6 +21,7 @@
   .  Randomized algorithms
   .  ?? Chazelle ??
   .  ?? Pettie ??
+  .  Other classes of graphs
 
 *  Ranking combinatorial objects
 
@@ -56,6 +57,7 @@ Spanning trees:
 - use the notation for contraction by a set
 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
 - parallel algorithms: p243-cole (are there others?)
+- mention 3-regular graphs; bounded expansion?
 
 Models:
 
@@ -70,6 +72,11 @@ Ranking:
 
 - the general perspective: is it only a technical trick?
 - ranking of permutations on general sets, relationship with integer sorting
+- 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
+- JN: bounded-degree restriction graphs; would it imply general speedup?
 
 Notation: