-- move TOC to the beginning of the book
-- mention notation
-- cite GA booklet
-
-Spanning trees:
-
-- cite Eisner's tutorial \cite{eisner:tutorial}
-- Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- use the notation for contraction by a set
-- mention bugs in Valeria's verification paper
-- more references on decision trees
-- Lemma: deletion of a non-MST edge does not alter the MST
-- 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