From 26f0c5e666c5f30ce6610d4d2054a592b6d3e190 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Tue, 15 Apr 2008 22:18:29 +0200
Subject: [PATCH] Prepare for K smallest spanning trees.

---
 biblio.bib | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/biblio.bib b/biblio.bib
index b4e14b1..2edd9d2 100644
--- 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}
+}
-- 
2.39.2