Fully dynamic biconnectivity in graphs
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The author presents an algorithm for maintaining the bi-connected 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/sup 2/3/), where m is the number of edges in the graph. Each query of the form 'Are the vertices u and v biconnected?' can be answered in time O(1). This is the first sublinear algorithm for this problem. If the input is a planar embedded graph, the amortized running time for insertions and deletions drops to O( square root nlogn) and the worst case query time is O((logn)/sup 2/), where n is the number of vertices in the graph. The best previously known solution takes time O(n/sup 2/3/) per update or query.Keywords
This publication has 8 references indexed in Scilit:
- Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maintaining bridge-connected and biconnected components on-lineAlgorithmica, 1992
- Fully dynamic 2-edge-connectivity in planar graphsPublished by Springer Nature ,1992
- Sparsification-a technique for speeding up dynamic graph algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969