3 - degree-restricted cases and arborescences
4 - bounded expansion classes?
8 - ranking of permutations on general sets, relationship with integer sorting
9 - JN: 4.5.1: neslo by preci isolovat nejaky vlstnosti restriction matrices
10 tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
11 co je to vlastne za matice co splnuji 4.5.2
12 - JN: bounded-degree restriction graphs; would it imply general speedup?
16 - formatting of multi-line \algin, \algout
20 > 2: simplify, remove proof sketches
21 > 3.1.7, 3.1.10: skip proof
22 > 3.5.1: does the first alg give any insight?
23 > 5: mention graphs with moving vertices?
27 > Remark on 2.5.1: polynomial time could be replaced by sub-exponential time.
28 - For 1.5.6, you should probably quote D. Cheriton and R.E. Tarjan.
29 Finding Minimum Spanning Trees. SIAM J. on Comp. 5(4) (1976) pp.
30 724-742. who gave a linear time algorithm for planar graphs, extended by
31 Tarjan in 1983 to proper minor closed classes (both quoted by Gustedt).
32 [XXX: The paper should be in the library at MS.]
33 > In 3.1.12 and 3.1.16, you should make explicit the dependence of the
34 running time with respect, for instance, to the Hadwiger number of the
35 graph or to the maximal density nabla(G) of a minor of the graph, as
36 considering a minor closed class or another does not change the
37 algorithm but only the bound on its running time.