CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Distributed
(
Ξ
+
1
)
(\Delta+1)
(
Ξ
+
1
)
-Coloring in Sublogarithmic Rounds
Authors
David G. Harris
Johannes Schneider
Hsin-Hao Su
Publication date
17 January 2018
Publisher
View
on
arXiv
Abstract
We give a new randomized distributed algorithm for
(
Ξ
+
1
)
(\Delta+1)
(
Ξ
+
1
)
-coloring in the LOCAL model, running in
O
(
log
β‘
Ξ
)
+
2
O
(
log
β‘
log
β‘
n
)
O(\sqrt{\log \Delta})+ 2^{O(\sqrt{\log \log n})}
O
(
lo
g
Ξ
β
)
+
2
O
(
l
o
g
l
o
g
n
β
)
rounds in a graph of maximum degree~
Ξ
\Delta
Ξ
. This implies that the
(
Ξ
+
1
)
(\Delta+1)
(
Ξ
+
1
)
-coloring problem is easier than the maximal independent set problem and the maximal matching problem, due to their lower bounds of
Ξ©
(
min
β‘
(
log
β‘
n
log
β‘
log
β‘
n
,
log
β‘
Ξ
log
β‘
log
β‘
Ξ
)
)
\Omega \left( \min \left( \sqrt{\frac{\log n}{\log \log n}}, \frac{\log \Delta}{\log \log \Delta} \right) \right)
Ξ©
(
min
(
l
o
g
l
o
g
n
l
o
g
n
β
β
,
l
o
g
l
o
g
Ξ
l
o
g
Ξ
β
)
)
by Kuhn, Moscibroda, and Wattenhofer [PODC'04]. Our algorithm also extends to list-coloring where the palette of each node contains
Ξ
+
1
\Delta+1
Ξ
+
1
colors. We extend the set of distributed symmetry-breaking techniques by performing a decomposition of graphs into dense and sparse parts
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:1603.01486
Last time updated on 03/08/2016