A Persistent Union-Find Data Structure

by Sylvain Conchon

Citations:

8 - 0 self

@MISC{Conchon_apersistent,
    author = {Sylvain Conchon},
    title = {A Persistent Union-Find Data Structure},
    year = {}
}

Abstract The problem of disjoint sets, also known as union-find, consistsin maintaining a partition of a finite set within a data structure.