Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Space-Efficient Biconnected Components and Recognition of Outerplanar
  Graphs   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.

28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol