Content deleted Content added
Rlucas stats (talk | contribs) |
|||
Line 253:
Sharir and Agarwal report connections between the worst-case behavior of disjoint-sets and the length of [[Davenport–Schinzel sequence|Davenport–Schinzel sequences]], a combinatorial structure from computational geometry.<ref name="Sharir1995">{{cite book|first1=M.|last1=Sharir|first2=P.|last2=Agarwal|title=Davenport-Schinzel sequences and their geometric applications|title-link= Davenport–Schinzel Sequences and Their Geometric Applications|publisher=Cambridge University Press|year=1995}}</ref>
The [[Hoshen–Kopelman_algorithm| Hoshen-Kopelman algorithm]] uses a Union-Find in the algorithm.
== See also ==
| |||