Special cases.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 9b562ec5a872da4e346225212f9020f0d59bc912..40a1092ddea5d97ee7020649d129d1efabff2bd6 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -21,7 +21,7 @@
   .  Randomized algorithms
   .  ?? Chazelle ??
   .  ?? Pettie ??
-  .  Other classes of graphs
+  o  Special cases and related problems
 
 *  Ranking combinatorial objects
 
@@ -48,17 +48,15 @@ Spanning trees:
 
 - cite Eisner's tutorial \cite{eisner:tutorial}
 - \cite{pettie:onlineverify} online lower bound
-- mention Steiner trees
 - mention matroids
 - mention disconnected graphs
-- Euclidean MST
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
 - reference to mixed Boruvka-Jarnik
 - 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?
-- floating-point weights
+- bounded expansion classes?
+- restricted cases and arborescences
 
 Models:
 
@@ -79,7 +77,6 @@ Ranking:
 
 Notation:
 
-- \O(...) as a set?
 - 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