year = "1991",
url = "citeseer.ist.psu.edu/frederickson91ambivalent.html" }
-@article{ tarjan84setunion,
+@article{ tarjan:setunion,
author = {Robert E. Tarjan and Jan van Leeuwen},
title = {Worst-case Analysis of Set Union Algorithms},
journal = {J. ACM},
year={1889},
pages={376--378}
}
+
+@article{ dijkstra:mst,
+ title={{A note on two problems in connexion with graphs}},
+ author = "Dijkstra, E. W.",
+ journal={Numerische Mathematik},
+ volume={1},
+ number={1},
+ pages={269--271},
+ year={1959},
+ publisher={Springer}
+}
+
+@article{ prim:mst,
+ author = "Prim, R. C.",
+ title = "Shortest connection networks and some generalizations",
+ journal = "Bell System Technical Journal",
+ volume = "36",
+ year = "1957",
+ pages={567--574},
+}
+
+@article{ choquet:mst,
+ title={{Etude de certains r{\'e}seaux de routes (in French)}},
+ author={Choquet, Gustave},
+ journal={Comptes-rendus de l'Académie des Sciences},
+ volume={206},
+ pages={310},
+ year={1938}
+}
+
+@incollection { sollin:mst,
+ title={{Le trace de canalisation (in French)}},
+ author={Sollin, M.},
+ booktitle={Programming, Games, and Transportation Networks},
+ editor={Berge, C. and Ghouilla-Houri, A.},
+ publisher={Wiley, New York},
+ year={1965}
+}