Maintaining the 3-edge-connected components of a graph on-line

The problem of maintaining the $3$-edge-connected components of a graph undergoing repeated dynamic modifications, such as edge and vertex insertions, is studied. This paper shows how to answer the question of whether or not two vertices belong to the same $3$-edge-connected component of a connected...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 22; no. 1; pp. 11 - 28
Main Authors ZVI GALIL, ITALIANO, G. F
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1993
Subjects
Algorithms
Applied sciences
Computer science
Computer science; control theory; systems
Connectivity
Exact sciences and technology
Graphs
Information retrieval. Graph
Theoretical computing
Graph theory
Edge connectivity
Dynamic data structure
Data structure
Algorithm analysis
Vertex connectivity
Online AccessGet full text

Cover

More Information
Summary:The problem of maintaining the $3$-edge-connected components of a graph undergoing repeated dynamic modifications, such as edge and vertex insertions, is studied. This paper shows how to answer the question of whether or not two vertices belong to the same $3$-edge-connected component of a connected graph that is undergoing only edge insertions. Any sequence of $q$ query and updates on an $n$-vertex graph can be performed in $O((n + q)\alpha (q,n))$ time.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0097-5397
1095-7111
DOI:10.1137/0222002