On the Complexity of Distributed Graph Coloring with Local Minimality Constraints

被引：15

作者：

Gavoille, Cyril ^{[1
]}

Klasing, Ralf ^{[1
]}

Kosowski, Adrian ^{[1
,2
]}

Kuszner, Lukasz ^{[2
]}

Navarra, Alfredo ^{[3
]}

机构：

[1] Univ Bordeaux 1, LaBRI, CNRS, F-33405 Talence, France

[2] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, PL-80952 Gdansk, Poland

[3] Univ Perugia, Dipartimento Matemat & Informat, I-06123 Perugia, Italy

来源：

NETWORKS | 2009年 / 54卷 / 01期

关键词：

distributed computing; graph coloring; greedy algorithm; randomization; ALGORITHMS; NETWORKS;

D O I：

10.1002/net.20293

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Distributed greedy coloring is an interesting and intuitive variation of the standard coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighboring vertices must receive different colors. We consider the problems of Greedy Coloring and Largest First Coloring (a variant of greedy coloring with strengthened constraints) in the Linial model of distributed computation, providing lower and upper bounds and a comparison to the (Delta + 1)-Coloring and Maximal Independent Set problems, with A being the maximum vertex degree in G. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(1), 12-19 2009

引用

页码：12 / 19

页数：8

共 50 条

[1] On the complexity of graph coloring with additional local conditions
Shitov, Yaroslav
[J]. INFORMATION PROCESSING LETTERS, 2018, 135 : 92 - 94
[2] On the Complexity of Local Distributed Graph Problems
Ghaffari, Mohsen
Kuhn, Fabian
Maus, Yannic
[J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 784 - 797
[3] Distributed Algorithms for the Lovasz Local Lemma and Graph Coloring
Chung, Kai-Min
Pettie, Seth
Su, Hsin-Hao
[J]. PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 134 - 143
[4] Distributed algorithms for the Lovasz local lemma and graph coloring
Chung, Kai-Min
Pettie, Seth
Su, Hsin-Hao
[J]. DISTRIBUTED COMPUTING, 2017, 30 (04) : 261 - 280
[5] Distributed algorithms for the Lovász local lemma and graph coloring
Kai-Min Chung
Seth Pettie
Hsin-Hao Su
[J]. Distributed Computing, 2017, 30 : 261 - 280
[6] Complexity Layers in Graph Coloring
Duffany, Jeffrey L.
[J]. IMCIC 2010: INTERNATIONAL MULTI-CONFERENCE ON COMPLEXITY, INFORMATICS AND CYBERNETICS, VOL I (POST-CONFERENCE EDITION), 2010, : 91 - 96
[7] Graph coloring with distance constraints
Calamoneri, T
Finocchi, I
Petreschi, R
[J]. PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, 2005, : 131 - 137
[8] On the complexity of distributed greedy coloring
Gavoille, Cyril
Klasing, Ralf
Kosowski, Adrian
Navarra, Alfredo
[J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, 4731 : 482 - 484
[9] Distributed Coloring of the Graph Edges
Omranpour, H.
Ebadzadeh, M.
Barzegar, S.
Shojafar, M.
[J]. PROCEEDINGS OF THE 2008 7TH IEEE INTERNATIONAL CONFERENCE ON CYBERNETIC INTELLIGENT SYSTEMS, 2008, : 240 - +
[10] Improved bounds on the complexity of graph coloring
Mann, Zoltan Adam
Szajko, Aniko
[J]. 12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010), 2011, : 347 - 354

← 1 2 3 4 5 →