Finish Kruskal.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index e1ed2267236a0984f40be8c0230f14a0365dccf9..02c69e6f34a920888d5ab8144fb78c6585c0f907 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -14,7 +14,7 @@
     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},
@@ -121,6 +121,26 @@
     note = "Czech with German summary"
 }
 
+@article { boruvka:networks,
+    author = "Otakar Bor{\accent23u}vka",
+    title = "{P\v{r}\'\i{}sp\v{e}vek k~\v{r}e\v{s}en\'\i{} ot\'azky ekonomick\'e stavby elektrovodn\'\i{}ch s\'\i{}t\'\i{} (Contribution to the solution of a problem of economical construction of electric networks)}",
+    journal = "Elektronick\'y obzor",
+    volume = "15",
+    year = "1926",
+    pages = "153--154",
+    note = "Czech"
+}
+
+@article { jarnik:ojistem,
+    author = "Vojt\v{e}ch Jarn\'\i{}k",
+    title = "{O jist\'em probl\'emu minim\'aln\'\i{}m (About a Certain Minimal Problem)}",
+    journal = "Pr\'ace mor. p\v{r}\'\i{}rodov\v{e}d. spol. v~Brn\v{e}",
+    volume = "VI",
+    year = "1930",
+    pages = "57--63",
+    note = "Czech"
+}
+
 @book { tarjan:dsna,
     author = "Robert E. Tarjan",
     title = "{Data structures and network algorithms}",
@@ -264,3 +284,60 @@
   year={2003},
   publisher={ACM Press New York, NY, USA}
 }
+
+@article{ graham:msthistory,
+  title={{On the history of the minimum spanning tree problem}},
+  author={Graham, R.L. and Hell, P.},
+  journal={Annals of the History of Computing},
+  volume={7},
+  number={1},
+  pages={43--57},
+  year={1985}
+}
+
+@article{ cayley:trees,
+  title={{A theorem on trees}},
+  author={Cayley, Arthur},
+  journal={Quart. J. Math},
+  volume={23},
+  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}
+}