Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Embedding Directed Graphs in Potential Fields Using FastMap-D   Embedding undirected graphs in a Euclidean space has many computational
benefits. FastMap is an efficient embedding algorithm that facilitates a
geometric interpretation of problems posed on undirected graphs. However,
Euclidean distances are inherently symmetric and, thus, Euclidean embeddings
cannot be used for directed graphs. In this paper, we present FastMap-D, an
efficient generalization of FastMap to directed graphs. FastMap-D embeds
vertices using a potential field to capture the asymmetry between the pairwise
distances in directed graphs. FastMap-D learns a potential function to define
the potential field using a machine learning module. In experiments on various
kinds of directed graphs, we demonstrate the advantage of FastMap-D over other
approaches.

5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
8
The categories of this paper are: hep-ex