Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computing the k Nearest-Neighbors for all Vertices via Dijkstra   We are given a directed graph $G = (V,E)$ with $n$ vertices and $m$ edges,
with positive weights on the edges, and a parameter $k >0$. We show how to
compute, for every vertex $v \in V$, its $k$ nearest-neighbors. The algorithm
runs in $O( k ( n \log n + m ) )$ time, and follows by a somewhat careful
modification of Dijkstra's shortest path algorithm.
  This result is probably folklore, but we were unable to find a reference to
it -- thus, this note.

7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg