Connected Components Maintenance
Connected Components Maintenance is a computational framework within graph algorithms that dynamically tracks and updates the connected components of a graph as edges are incrementally added, distinguishing itself by efficiently supporting union and find operations through the Disjoint Set Union data structure.
23
Publications
1.2K
Citations
31
Authors
28
Institutions
Publications per year
2017–2026
1
Parents
23
On-line maintenance of the four-connected components of a graph
Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista et al. · 2002 · 52 citations
1–5 of 23
31
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 31
28
Siemens (Hungary)
Budapest, Hungary
3 h-index
3 publications
59 citations

University of Warsaw
Warsaw, Poland
3 h-index
4 publications
92 citations
Stanford University
Stanford, United States
3 h-index
5 publications
157 citations
Google (United States)
Mountain View, United States
2 h-index
2 publications
31 citations
University of California, Santa Barbara
Santa Barbara, United States
2 h-index
2 publications
46 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
93 citations
Princeton University
Princeton, United States
2 h-index
3 publications
261 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
54 citations
1–8 of 28
5 publications · 483 citations
5
h-index
3 publications · 316 citations
3
h-index
Conference · 2 publications · 75 citations
2
h-index
1 publications · 34 citations
1
h-index
TALG · 1 publications · 47 citations
1
h-index
1–5