## Abstract

We consider the twin problems of maintaining the bridge-connected components and the biconnected components of a dynamic undirected graph. The allowed changes to the graph are vertex and edge insertions. We give an algorithm for each problem. With simple data structures, each algorithm runs in O(n log n +m) time, where n is the number of vertices and m is the number of operations. We develop a modified version of the dynamic trees of Sleator and Tarjan that is suitable for efficient recursive algorithms, and use it to reduce the running time of the algorithms for both problems to O(mα(m, n)), where α is a functional inverse of Ackermann's function. This time bound is optimal. All of the algorithms use O(n) space.

Original language | English (US) |
---|---|

Pages (from-to) | 433-464 |

Number of pages | 32 |

Journal | Algorithmica |

Volume | 7 |

Issue number | 1-6 |

DOIs | |

State | Published - Jun 1992 |

## All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Computer Science Applications
- Applied Mathematics

## Keywords

- Data structures
- Dynamic trees
- Graph algorithms
- Graph connectivity
- On-line algorithms