Mention grant and thesis.

diff --git a/biblio.bib b/biblio.bib
index a21c1c0380de3434b15c4a5cc8e4ad7762a6ff7f..5b86570a51e4cd691506b8d8b6df76514ff27ccd 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1598,3 +1598,10 @@
   pages={724--742},
   year={1976},
 }
+
+@phdthesis{ mm:thesis,
+  author={Mare\v{s}, M.},
+  title={{Graph Algorithms}},
+  school={{Charles University in Prague, Faculty of Math and Physics}},
+  year={2008},
+}

diff --git a/mst.tex b/mst.tex
index 97dad84a37570403fbe476cd31391f4743887eee..6d97dc101126384f1043fc035e092968ec5f1b9b 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -57,7 +57,8 @@ mosaic.
 When compared with the earlier surveys on the minimum spanning trees, most
 notably Graham and Hell \cite{graham:msthistory} and Eisner \cite{eisner:tutorial},
 this work adds many of the recent advances, the dynamic algorithms and
-also the relationship with computational models.
+also the relationship with computational models. It is based on the author's
+PhD thesis \cite{mm:thesis}.
 
 \nota
 We have tried to stick to the usual notation except where it was too inconvenient.

diff --git a/saga.tex b/saga.tex
index 329e3cae942160ec73f1bca2a2db49dca92324c3..c977ecb8217e38d3496c7f2044ef95332f8709d2 100644 (file)
--- a/saga.tex
+++ b/saga.tex
@@ -10,7 +10,8 @@
 \medskip
 \centerline{Department of Applied Mathematics}
 \centerline{and}
-\centerline{Institute of Theoretical Computer Science}
+\centerline{Institute of Theoretical Computer Science\foot{%
+Partially supported by grant 1M0021620808 of the Czech Ministry of Education.}}
 \centerline{Charles University}
 \centerline{Malostransk\' e n\' am. 25, 118~00 Praha, Czech Republic}