More Fibonacci.

diff --git a/macros.tex b/macros.tex
index bedae0c16f8539fd5fd1560e4ab0169ee92ece95..eb4d4ee0faa424889461609c774dd61cde61e277 100644 (file)
--- a/macros.tex
+++ b/macros.tex
@@ -294,9 +294,11 @@
 \medskip
 }
 
-\def\proclaim#1{\advance\thmcount by 1
+\def\para{\advance\thmcount by 1
 \edef\currentid{\the\chapcount.\the\seccount.\the\thmcount}
-\noindent {\bo \currentid.\enspace #1.\enspace}}
+\noindent {\bo \currentid.\enspace}}
+
+\def\proclaim#1{\para {\bo #1.\enspace}}
 
 \def\thm{\proclaim{Theorem}}
 \def\lemma{\proclaim{Lemma}}

diff --git a/mst.tex b/mst.tex
index b8396b2e2ae1ace5db61a91dedceeafa16872ccc..9bde5ab6b78c868ebdb34c28755aba3dd0c18e84 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -595,6 +595,7 @@ We will also keep a list of all vertex structures. During the bucket sort, each
 structure will contain a pointer to the corresponding bucket and the vertex list will
 define the order of vertices (which can be arbitrary).
 
+\para
 Graph contractions are indeed a~very powerful tool and they can be used in other MST
 algorithms as well. The following lemma shows the gist:
 
@@ -944,8 +945,22 @@ authors claim implementation advantages.
 
 \FIXME{Mention Thorup's Fibonacci-like heaps for integers?}
 
+\rem
+For sparse graphs, we can cross-breed this algorithm with the contractive
+Bor\o{u}vka's algorithm: First perform $\log\log n$ steps of contractive
+Bor\o{u}vka, which takes $\O(m\log\log n)$ time and produces a~graph~$G'$
+with $m'\le m$ and $n'\le n/\log n$. Then run Algorithm~\ref{jarniktwo} on~$G'$
+and it finishes in time $\O(m'+n'\log n') = \O(m)$. Finally combine MST edges
+found by both algorithms to a~single tree as in~the Contraction lemma (\ref{contlemma}).
+
+\para Xyzzy.
+
+\FIXME{Describe the heap limitation trick and the $\O(m\beta(m,n))$ algorithm.}
+
+
 
 
+% use \para
 % G has to be connected, so m=O(n)
 % mention Steiner trees
 % mention matroids

diff --git a/notation.tex b/notation.tex
index 429e7dd4a2fc5663b762679f2d5c7a05d2670711..0da0035ab4b90706daaf22279978abd0282432fc 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -35,6 +35,7 @@
 \n{$\deg_G(v)$}{degree of vertex~$v$ in graph~$G$; we omit $G$ if it is clear from context}
 \n{${\bb E}X$}{expected value of a~random variable~$X$}
 \n{${\rm Pr}[\varphi]$}{probability that a predicate~$\varphi$ is true}
+\n{$\log n$}{a binary logarithm of the number~$n$}
 }
 
 \section{Multigraphs and contractions}