Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On a Decentralized $(\Delta{+}1)$-Graph Coloring Algorithm   We consider a decentralized graph coloring model where each vertex only knows
its own color and whether some neighbor has the same color as it. The
networking community has studied this model extensively due to its applications
to channel selection, rate adaptation, etc. Here, we analyze variants of a
simple algorithm of Bhartia et al. [Proc., ACM MOBIHOC, 2016]. In particular,
we introduce a variant which requires only $O(n\log\Delta)$ expected
recolorings that generalizes the coupon collector problem. Finally, we show
that the $O(n\Delta)$ bound Bhartia et al. achieve for their algorithm still
holds and is tight in adversarial scenarios.

8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph