More verification.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 6d9df0075a74b52f1cfaf7244a102e0d265841cd..10335d477189d1202b194b9ef173da29808d203a 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1033,3 +1033,48 @@ inproceedings{ pettie:minirand,
   year={1998},
   publisher={ACM Press New York, NY, USA}
 }
+
+@article{ harel:nca,
+  title={{Fast algorithms for finding nearest common ancestors}},
+  author={Harel, D. and Tarjan, R.E.},
+  journal={SIAM Journal on Computing},
+  volume={13},
+  number={2},
+  pages={338--355},
+  year={1984},
+  publisher={Society for Industrial and Applied Mathematics Philadelphia, PA, USA}
+}
+
+@article{ gomoryhu,
+   author = "R. E. Gomory and T. C. Hu",
+   title = "Multi-Terminal Network Flows",
+   journal = "{Journal of SIAM}",
+   volume = {9},
+   number = {4},
+   year = {1961},
+   pages = {551--570}
+}
+
+@inproceedings{ bhalgat:ght,
+ author = {Ramesh Hariharan and Telikepalli Kavitha and Debmalya Panigrahi and Anand Bhalgat},
+ title = {{An $\widehat\O(mn)$ Gomory-Hu tree construction algorithm for unweighted graphs}},
+ booktitle = {STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing},
+ year = {2007},
+ isbn = {978-1-59593-631-8},
+ pages = {605--614},
+ location = {San Diego, California, USA},
+ doi = {http://doi.acm.org/10.1145/1250790.1250879},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}
+
+@article{ sleator:trees,
+  title={{A data structure for dynamic trees}},
+  author={Sleator, D.D. and Tarjan, R.E.},
+  journal={Journal of Computer and System Sciences},
+  volume={26},
+  number={3},
+  pages={362--391},
+  year={1983},
+  publisher={Academic Press, Inc. Orlando, FL, USA}
+}