4 research outputs found
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
We present space-efficient algorithms for computing cut vertices in a given
graph with vertices and edges in linear time using bits. With the same time and using bits, we can compute the
biconnected components of a graph. We use this result to show an algorithm for
the recognition of (maximal) outerplanar graphs in time using
bits