Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Evaluating regular path queries under the all-shortest paths semantics   The purpose of this report is to explain how the textbook breadth-first
search algorithm (BFS) can be modified in order to also create a compact
representation of all shortest paths connecting a single source node to all the
nodes reachable from it. From this representation, all these paths can also be
efficiently enumerated. We then apply this algorithm to solve a similar problem
in edge labelled graphs, where paths also have an additional restriction that
their edge labels form a word belonging to a regular language. Namely, we solve
the problem of evaluating regular path queries (RPQs) under the all-shortest
paths semantics.

3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
31
The categories of this paper are: ao-sci
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex