• Published 1992

Fully Dynamic Biconnectivity in Graphs to Appear in Algorithmica

@inproceedings{Rauch1992FullyDB,
  title={Fully Dynamic Biconnectivity in Graphs to Appear in Algorithmica},
  author={Monika U. Rauch},
  year={1992}
}
We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions is O(m 2=3), where m is the number of edges in the graph. Any query of the form \Are the vertices u and v biconnected?" can be answered in time O(1). This is the rst sublinear algorithm for this problem. We can also output all articulation points separating… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Italiano , \ On - line Algorithms for Polynomially Solvable Satis ability Problems " J

  • G. F. G. Ausiello
  • . Logic Programming
  • 1991

\ Maintenance ofa Minimum Spanning Forest in a Dynamic Planar Graph " Proc . 1 st Annual Symp

  • G. F. Italiano D. Eppstein, R. Tamassia, R. E. Tarjan, J. Westbrook, M. Yung