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

Authors

31

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    5 publications · 201 citations

    5

    h-index

  2. RT
    Roberto Tamassia

    Brown University, United States

    4 publications · 296 citations

    4

    h-index

  3. JW
    Jeffery Westbrook

    AT&T (United States), United States

    3 publications · 211 citations

    3

    h-index

  4. JH
    John Hershberger

    Stanford University, United States

    3 publications · 59 citations

    3

    h-index

  5. GD
    Giuseppe Di Battista

    Roma Tre University, Italy

    3 publications · 233 citations

    3

    h-index

1–5 of 31

Venues

  1. SIAM Journal on Computing

    5 publications · 483 citations

    5

    h-index

  2. Algorithmica

    3 publications · 316 citations

    3

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 2 publications · 75 citations

    2

    h-index

  4. Discrete & Computational Geometry

    1 publications · 34 citations

    1

    h-index

  5. ACM Transactions on Algorithms

    TALG · 1 publications · 47 citations

    1

    h-index

1–5