Prepare for K smallest spanning trees.

diff --git a/biblio.bib b/biblio.bib
index b4e14b1b4963fa6f2598009d35339f3033871805..2edd9d2ef6c1b61cdbd04b3283f79c366c519f34 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1376,3 +1376,24 @@
   series={{Lecture Notes in Computer Science}},
   volume={156}
 }
+
+@article{ eppstein:ksmallest,
+  title={{Finding the $k$~Smallest Spanning Trees}},
+  author={Eppstein, D.},
+  journal={BIT},
+  volume={32},
+  number={2},
+  pages={237--248},
+  year={1992},
+  publisher={Springer}
+}
+
+@article{ katoh:ksmallest,
+  title={{An Algorithm for Finding\$ K\$ Minimum Spanning Trees}},
+  author={Katoh, N. and Ibaraki, T. and Mine, H.},
+  journal={SIAM Journal on Computing},
+  volume={10},
+  pages={247},
+  year={1981},
+  publisher={SIAM}
+}