From: Martin Mares <mj@ucw.cz>
Date: Tue, 4 Mar 2008 16:05:14 +0000 (+0100)
Subject: TODO from JN.
X-Git-Tag: printed~196
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=412c9adacd1d335548da95f1018776aac1a37483;p=saga.git

TODO from JN.
---

diff --git a/PLAN b/PLAN
index 8ea33fa..865e111 100644
--- 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: