TODO:
+Preface:
+
+- move TOC to the beginning of the book
+- mention notation
+- cite GA booklet
+
Spanning trees:
- cite Eisner's tutorial \cite{eisner:tutorial}
-- move the remark on disconnected graphs? separate section?
-- mention graphs with non-unique weights? also in the separate section?
- Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- citation of mixed Boruvka-Jarnik
- use the notation for contraction by a set
- mention bugs in Valeria's verification paper
- more references on decision trees
-- rename theorem on Minimality by order
-- introduce Cut rule and Cycle rule earlier
- Lemma: deletion of a non-MST edge does not alter the MST
-- use the name "Boruvka step"
+- mention that there are only a few algorithms based on the Red rule
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
-- mention in-place radix-sorting?
-- consequences of Q-Heaps: Thorup's undirected SSSP etc.
-- add more context from thorup:aczero, also mention FP operations
-- Tarjan79 is mentioned by Pettie to define Pointer machines
-- add references to the C language
-- PM: unify yardsticks
-- all data structures should mention space complexity
+- finding all MST's
Ranking:
- 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
+ co je to vlastne za matice co splnuji 4.5.2
- JN: bounded-degree restriction graphs; would it imply general speedup?
Notation:
+- sort the table
- 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
- unify use of n(G) vs. n
- change the notation for contractions -- use double slash instead of the dot?
- introduce \widehat\O early
-- Ackermann: which of the Tarjan's set union papers should we cite?
Typography:
Global:
-- Intro: cite GA booklet
- each chapter should make clear in which model we work
- clean up bibliography
+
+Pictures:
+
+- structure of a Q-heap
projects / saga.git / blobdiff