Algorithmica

, Volume 7, Issue 1, pp 433–464

Maintaining bridge-connected and biconnected components on-line

Authors

  • Jeffery Westbrook
    • Department of Computer ScienceYale University
  • Robert E. Tarjan
    • Department of Computer SciencePrinceton University
    • NEC Research Institute
Article

DOI: 10.1007/BF01758773

Cite this article as:
Westbrook, J. & Tarjan, R.E. Algorithmica (1992) 7: 433. doi:10.1007/BF01758773

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 inO(n logn +m) time, wheren is the number of vertices andm 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 toO(mα(m,n)), where α is a functional inverse of Ackermann's function. This time bound is optimal. All of the algorithms useO(n) space.

Key words

On-line algorithmsGraph algorithmsGraph connectivityDynamic treesData structures

Copyright information

© Springer-Verlag New York Inc. 1992