From 30a831565504d75e67b6d9875190f55086e5546c Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Sat, 19 Apr 2008 15:19:13 +0200
Subject: [PATCH] Fixed set union citations.

---
 PLAN       |  1 -
 biblio.bib | 13 ++++++++++++-
 2 files changed, 12 insertions(+), 2 deletions(-)

diff --git a/PLAN b/PLAN
index 6f6313e..953ff49 100644
--- a/PLAN
+++ b/PLAN
@@ -101,7 +101,6 @@ Notation:
 - unify use of n(G) vs. n
 - change the notation for contractions -- use double slash instead of the dot?
 - introduce \widehat\O early
-- Ackermann: which of the Tarjan's set union papers should we cite?
 
 Typography:
 
diff --git a/biblio.bib b/biblio.bib
index ea0f7d8..7f6107f 100644
--- a/biblio.bib
+++ b/biblio.bib
@@ -14,7 +14,7 @@
     year = "1991",
     url = "citeseer.ist.psu.edu/frederickson91ambivalent.html" }
 
-@article{ tarjan:setunion,
+@article{ tarjan:wcsetunion,
  author = {Robert E. Tarjan and Jan van Leeuwen},
  title = {Worst-case Analysis of Set Union Algorithms},
  journal = {J. ACM},
@@ -28,6 +28,17 @@
  address = {New York, NY, USA},
 }
 
+@article{ tarjan:setunion,
+  title={{Efficiency of a Good But Not Linear Set Union Algorithm}},
+  author={Tarjan, R.E.},
+  journal={Journal of the ACM},
+  volume={22},
+  number={2},
+  pages={215--225},
+  year={1975},
+  publisher={ACM Press New York, NY, USA}
+}
+
 @inproceedings { fw:transdich,
    author = "M. Fredman and D. E. Willard",
    title = "{Trans-dichotomous algorithms for minimum spanning trees and shortest paths}",
-- 
2.39.2