Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A scalable method to find the shortest path in a graph with circuits of
  memristors   Finding the shortest path in a graph has applications to a wide range of
optimization problems. However, algorithmic methods scale with the size of the
graph in terms of time and energy. We propose a method to solve the shortest
path problem using circuits of nanodevices called memristors and validate it on
graphs of different sizes and topologies. It is both valid for an
experimentally derived memristor model and robust to device variability. The
time and energy of the computation scale with the length of the shortest path
rather than with the size of the graph, making this method particularly
attractive for solving large graphs with small path lengths.

30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
19
The categories of this paper are: eess