## Experimental Evaluation of Algorithms for Incremental Graph Connectivity and Biconnectivity

- M. Korupolu, R. Mettu, V. Ramachandran, Y. Zhao
- Presented at the Fifth DIMACS Implementation…
- 1996

Highly Influential

- Published 1997

Abstract. We describe our implementation of an algorithm to maintain the connected components and the biconnected components of a graph where vertex and edge insertions are allowed. Algorithms for this problem can be applied to task decomposition in engineering design. Connected components are maintained using a disjoint set data structure and the… (More)

### Presentations referencing similar topics