First parts of the section on Almost minimum trees.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 33115567ebcc4fcd2e55f5421334eed8b6fb8906..f489749bfce79ba73fa8e11e7aa63496c282b05b 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -6,7 +6,18 @@
     year = "2000",
     url = "citeseer.ist.psu.edu/bender00lca.html" }
 
-@inproceedings{ frederickson91ambivalent,
+@article{ frederickson:ambivalent,
+  author = "Frederickson, Greg N.",
+  title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees",
+  journal={SIAM journal on computing},
+  volume={26},
+  number={2},
+  pages={484--538},
+  year={1997},
+  publisher={Society for Industrial and Applied Mathematics}
+}
+
+@inproceedings{ frederickson:ambifocs,
     author = "Greg N. Frederickson",
     title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees",
     booktitle = "{IEEE} Symposium on Foundations of Computer Science",