From ae869e0f447d4a7c11f8b146ca3cd0aa5b6aed66 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Sat, 13 Sep 2008 21:14:50 +0200
Subject: [PATCH] Added an abstract.

---
 epilog.tex |  2 +-
 macros.tex | 11 ++++++++---
 saga.tex   | 29 +++++++++++++++++++++++++++--
 3 files changed, 36 insertions(+), 6 deletions(-)

diff --git a/epilog.tex b/epilog.tex
index d655ddf..f522e13 100644
--- a/epilog.tex
+++ b/epilog.tex
@@ -33,7 +33,7 @@ from the upper ones.
 The known algorithms run on the Pointer machine and we do not know if using a~stronger
 model can help.
 
-Aside from the concrete problems we have solved, we have also built several algorithmic
+Aside from the concrete problems we have solved, we have also described several algorithmic
 techniques of general interest: the unification procedures using pointer-based
 bucket sorting (Section \ref{bucketsort}) and the vector computations on the RAM
 (Section \ref{bitsect}). We hope that they will be useful in many other algorithms.
diff --git a/macros.tex b/macros.tex
index f6faac0..e4e1a70 100644
--- a/macros.tex
+++ b/macros.tex
@@ -256,10 +256,15 @@
 \fi
 }
 
-\def\rawchapter#1{\vfill\supereject
-\oddpage
-\leftline{\chapfont #1}
+\def\rawchapter#1{
+%\vfill\supereject
+%\oddpage
+\bigbreak
 \bigskip
+\vensure{0.5in}
+\leftline{\chapfont #1}
+%\bigskip
+\medskip
 }
 
 \def\unchapter#1{
diff --git a/saga.tex b/saga.tex
index 59e3d70..0f8734c 100644
--- a/saga.tex
+++ b/saga.tex
@@ -2,8 +2,30 @@
 \input fonts12.tex
 \let\endpart=\relax
 
-\unchapter{Table of contents}
-\includetoc
+\font\titfont=cmb17
+
+\centerline{\titfont The Saga of Minimum Spanning Trees}
+\bigskip
+\centerline{Martin Mare\v{s}\foot{\tt mares@kam.mff.cuni.cz}}
+\medskip
+\centerline{Department of Applied Mathematics}
+\centerline{Charles University in Prague, Czech Republic}
+
+\bigskip
+\bigskip
+{\leftskip=0.5in \rightskip=\leftskip
+\noindent {\sc Abstract:}
+This article surveys the many facets of the Minimum Spanning Tree problem.
+We follow the history of the problem since the first polynomial-time solution
+by Bor\o{u}vka to the modern algorithms by Chazelle, Pettie and Ramachandran.
+We study the differences in time complexity dependent on the model of
+computation chosen and on the availibility of random bits. We also briefly
+touch the dynamic maintenance of the MST and other related problems.
+
+}
+
+\bigskip
+\bigskip
 
 \input mst.tex
 \input ram.tex
@@ -21,4 +43,7 @@
 \dumpbib
 \vfill\eject
 
+\unchapter{Table of contents}
+\includetoc
+
 \bye
-- 
2.39.5