| Articolul precedent |
| Articolul urmator |
 |
 305 3 |
| Ultima descărcare din IBN: 2023-04-18 23:16 |
 SM ISO690:2012ANDRIEȘ, 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, 29-31 martie 2022, Chișinău. Chișinău, Republica Moldova: Tehnica-UTM, 2022, Vol.1, pp. 407-410. ISBN 978-9975-45-828-3.. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conferinţa tehnico-ştiinţifică a studenţilor, masteranzilor şi doctoranzilor Vol.1, 2022 |
||||||
|
Conferința "Conferinţa tehnico-ştiinţifică a studenţilor, masteranzilor şi doctoranzilor" Chișinău, Moldova, 29-31 martie 2022 | ||||||
|
||||||
| Pag. 407-410 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie algorithms, inverse Ackermann function, amortized constant time, graph, optimization, shortest spanning tree, union-find |
||||||
|
|
|
|
