DSpace Repository

The Disjoint-Set data structure and its performance

Show simple item record

dc.contributor.author ANDRIEȘ, Alexandru
dc.contributor.author KONJEVIC, Alexandra
dc.contributor.author AFTENI, Maria
dc.date.accessioned 2022-08-11T10:20:42Z
dc.date.available 2022-08-11T10:20:42Z
dc.date.issued 2022
dc.identifier.citation ANDRIEȘ, Alexandru, KONJEVIC, Alexandra, AFTENI, Maria. The Disjoint-Set data structure and its performance. In: Conferinţa tehnico-ştiinţifică a studenţilor, masteranzilor şi doctoranzilor = Technical Scientific Conference of Undergraduate, Master and PhD Students, Universitatea Tehnică a Moldovei, 29-31 martie 2022. Chișinău, 2022, vol. 1, pp. 407-410. ISBN 978-9975-45-828-3. ISBN 978-9975-45-829-0 (Vol.1). en_US
dc.identifier.isbn 978-9975-45-828-3
dc.identifier.isbn 978-9975-45-829-0
dc.identifier.uri http://repository.utm.md/handle/5014/20693
dc.description.abstract Disjoint-set data structure is a data structure that stores a collection of disjoint (nonoverlapping) sets.The Disjoint-Set data structures (also called Union-Find) is a very elegant and efficient way of analyzing connectivity in a graph. It makes use of the concept of dynamic programming to reach its running speed. Using splitting or halving with union by size or by rank, or using path compression, we can reduce the running time of these operations. en_US
dc.language.iso en en_US
dc.publisher Universitatea Tehnică a Moldovei en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject disjoint-set data en_US
dc.subject Ackermann function en_US
dc.subject graphs en_US
dc.subject spanning tree en_US
dc.title The Disjoint-Set data structure and its performance en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account