From cefd40957b86dfabdf07048d080b2eacb0147f80 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Thu, 10 Apr 2008 16:53:14 +0200 Subject: [PATCH] Replanning. --- PLAN | 17 ++++++++++------- 1 file changed, 10 insertions(+), 7 deletions(-) diff --git a/PLAN b/PLAN index 050f0ea..02e8af2 100644 --- a/PLAN +++ b/PLAN @@ -31,7 +31,7 @@ * Dynamic MST algorithms - . (Semi-)dynamic algorithms + o (Semi-)dynamic algorithms . ET-trees . Fully dynamic connectivity . Dynamic MST @@ -52,20 +52,23 @@ Spanning trees: - cite Eisner's tutorial \cite{eisner:tutorial} - \cite{pettie:onlineverify} online lower bound -- mention matroids - 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 -- practical considerations: katriel:cycle, moret:practice (mention pairing heaps) -- parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel -- bounded expansion classes? -- degree-restricted cases and arborescences -- random sampling (propp:randommst) - 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) +- degree-restricted cases and arborescences +- bounded expansion classes? +- mention matroids + Models: - bit tricks: reference to HAKMEM -- 2.39.2