Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Shortest Path Algorithms for Hypergraphs   A hypergraph is a set V of vertices and a set of non-empty subsets of V,
called hyperedges. Unlike graphs, hypergraphs can capture higher-order
interactions in social and communication networks that go beyond a simple union
of pairwise relationships. In this paper, we consider the shortest path problem
in hypergraphs. We develop two algorithms for finding and maintaining the
shortest hyperpaths in a dynamic network with both weight and topological
changes. These two algorithms are the first to address the fully dynamic
shortest path problem in a general hypergraph. They complement each other by
partitioning the application space based on the nature of the change dynamics
and the type of the hypergraph.

14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math