A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Editors: Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier; Article No. 56

*
14 Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum für Informatik
*
unpublished

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 log n}) 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. 1 Introduction Nowadays the use of small mobile devices like tablets and smartphones is ubiquitous.

fatcat:lcmc6hjtgbgihmdg4kzh5lhtiu