Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Algorithms for the Massively Parallel Computation Model   The Massive Parallel Computing (MPC) model gained popularity during the last
decade and it is now seen as the standard model for processing large scale
data. One significant shortcoming of the model is that it assumes to work on
static datasets while, in practice, real-world datasets evolve continuously. To
overcome this issue, in this paper we initiate the study of dynamic algorithms
in the MPC model.
  We first discuss the main requirements for a dynamic parallel model and we
show how to adapt the classic MPC model to capture them. Then we analyze the
connection between classic dynamic algorithms and dynamic algorithms in the MPC
model. Finally, we provide new efficient dynamic MPC algorithms for a variety
of fundamental graph problems, including connectivity, minimum spanning tree
and matching.

15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
10
The categories of this paper are: q-bio
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
35
The categories of this paper are: mtrl-th