Revision as of 04:18, 24 December 2005 edit Dcoetzee (talk \| contribs) 37,529 edits Add references ← Previous edit		Revision as of 04:18, 24 December 2005 edit undo Dcoetzee (talk \| contribs) 37,529 edits m →References: enter Next edit →
Line 113: * [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0262032937. Chapter 21: Data structures for Disjoint Sets, pp.498–524. * Zvi Galil and Giuseppe F. Italiano. Data structures and algorithms for disjoint set union problems", ACM Computing Surveys, Volume 23, Issue 3 (September 1991), pages 319-344. [http://portal.acm.org/citation.cfm?id=116878 ACM Digital Library] ~~ACM Computing Surveys, Volume 23, Issue 3 (September 1991), pages 319-344. [http://portal.acm.org/citation.cfm?id=116878 ACM Digital Library]~~

Disjoint-set data structure: Difference between revisions