Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs

@inproceedings{Kammer2016SpaceEfficientBC,
  title={Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs},
  author={Frank Kammer and Dieter Kratsch and Moritz Laudahn},
  booktitle={MFCS},
  year={2016}
}
We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using O(n + min{m,n log logn}) bits. With the same time and using O(n+m) 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 O(n log log n) time using O(n) bits. 
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS