Remark on edge densities.

diff --git a/mst.tex b/mst.tex
index dadd2a0f6d13bbf64c8591dd10efb851dbf538e5..9c21ffa41eec80048ed95afa95ee37847c3f8c2d 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -1079,7 +1079,15 @@ The Iterated Jarn\'\i{}k's algorithm runs in time $\O(m\log^* n)$.
 $\beta(m,n) \le \beta(1,n) = \log^* n$.
 \qed
 
+\cor
+When we use the Iterated Jarn\'\i{}k's algorithm on graphs with edge density
+at least~$\log^{(k)} n$ for some $k\in{\bb N}^+$, it runs in time~$\O(km)$.
+
+\proof
+If $m/n \ge \log^{(k)} n$, then $\beta(m,n)\le k$.
+\qed
 
+\FIXME{Reference to Q-Heaps.}
 
 
 

diff --git a/notation.tex b/notation.tex
index 12cf520d559fb6992842d7390d10ba1125a379de..3c63ac2dbe73f1bf5f52ddee11acfd457c612972 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -9,6 +9,7 @@
 \def\[#1]{[\ref{#1}]}
 \n{$\bb R$}{the set of all real numbers}
 \n{$\bb N$}{the set of all natural numbers, including 0}
+\n{${\bb N}^+$}{the set of all positive integers}
 \n{$T[u,v]$}{the path in a tree~$T$ joining vertices $u$ and $v$ \[heavy]}
 \n{$T[e]$}{the path in a tree~$T$ joining the endpoints of an~edge~$e$ \[heavy]}
 \n{$A\symdiff B$}{symetric difference of sets: $(A\setminus B) \cup (B\setminus A)$}