Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Parallel Construction of Compact Planar Embeddings   The sheer sizes of modern datasets are forcing data-structure designers to
consider seriously both parallel construction and compactness. To achieve those
goals we need to design a parallel algorithm with good scalability and with low
memory consumption. An algorithm with good scalability improves its performance
when the number of available cores increases, and an algorithm with low memory
consumption uses memory proportional to the space used by the dataset in
uncompact form. In this work, we discuss the engineering of a parallel
algorithm with linear work and logarithmic span for the construction of the
compact representation of planar embeddings. We also provide an experimental
study of our implementation and prove experimentally that it has good
scalability and low memory consumption. Additionally, we describe and test
experimentally queries supported by the compact representation.

34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph