Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Data structure for representing a graph: combination of linked list and
  hash table   In this article we discuss a data structure, which combines advantages of two
different ways for representing graphs: adjacency matrix and collection of
adjacency lists. This data structure can fast add and search edges (advantages
of adjacency matrix), use linear amount of memory, let to obtain adjacency list
for certain vertex (advantages of collection of adjacency lists). Basic
knowledge of linked lists and hash tables is required to understand this
article. The article contains examples of implementation on Java.

21
The categories of this paper are: adap-org
2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio