Connect K best to the introductory chapters.

[saga.git] / dyn.tex

diff --git a/dyn.tex b/dyn.tex
index e7432fca64e7604960cbd43e8afd8dc0785015dc..7197b22b68b2e8cd77515bc49c8ec3d6a180589b 100644 (file)
--- a/dyn.tex
+++ b/dyn.tex
@@ -957,5 +957,8 @@ to $\O(Km^{1/2})$ and improving Theorem \ref{kbestthm} to $\O(m\timesalpha(m,n)
 chapter could be modified to bring the complexity of finding the next tree down
 to polylogarithmic.
 
+\paran{Multiple minimum trees}%
+Another nice application of Theorem \ref{kbestthm} is finding all minimum spanning
+trees in a~graph that does not have distinct edge weights.
 
 \endpart