Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A reduction of the logspace shortest path problem to biconnected graphs   In this paper, we reduce the logspace shortest path problem to biconnected
graphs; in particular, we present a logspace shortest path algorithm for
general graphs which uses a logspace shortest path oracle for biconnected
graphs. We also present a linear time logspace shortest path algorithm for
graphs with bounded vertex degree and biconnected component size, which does
not rely on an oracle. The asymptotic time-space product of this algorithm is
the best possible among all shortest path algorithms.

31
The categories of this paper are: ao-sci
36
The categories of this paper are: cmp-lg
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
10
The categories of this paper are: q-bio
12
The categories of this paper are: nucl-th