Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimum Eccentricity Shortest Path Problem with Respect to Structural
  Parameters   The Minimum Eccentricity Shortest Path Problem consists in finding a shortest
path with minimum eccentricity in a given undirected graph. The problem is
known to be NP-complete and W[2]-hard with respect to the desired eccentricity.
We present fpt algorithms for the problem parameterized by the modular width,
distance to cluster graph, the combination of distance to disjoint paths with
the desired eccentricity, and maximum leaf number.

0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
31
The categories of this paper are: ao-sci