Kruskal.

diff --git a/PLAN b/PLAN
index 900e7bd72a4bafd6b3414297ceb6c5e70feb6b0c..c8a1a60b3724ecbc71ea1d0a8aafd0536e192d64 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -69,5 +69,4 @@ Typography:
 Global:
 
 - each chapter should make clear in which model we work
-- clean up bibliography
 - intro: \log is binary

diff --git a/biblio.bib b/biblio.bib
index 5c949b1d57d26f593081396a336b1889d746f841..2971a2758702ba36452e05d465449c309d5bd169 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -329,7 +329,7 @@
 
 @article{ kruskal:mst,
   title={{On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem}},
-  author={Kruskal Jr, J. B.},
+  author={Kruskal, Jr, J. B.},
   journal={Proceedings of the American Mathematical Society},
   volume={7},
   number={1},