Geodesic
On graph coloring in a~class of parallel local algorithms
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 14 (2011) no. 3, pp. 231-243

Voir la notice de l'article provenant de la source Math-Net.Ru

One of the ways for improving the performance of a distributed algorithm is representation of the coloring strategy into the algorithm which, as known, is efficient in non-distributed algorithms. In this paper we show that application of a certain sequential coloring algorithm heuristics such as the largest-first (SL), the smallest-last (SL) and the saturation largest-first (SLF) for some classes of graphs and for special cases of the vertex coloring in the distributed algorithms give us optimal or near-optimal coloring. 
@article{SJVM_2011_14_3_a0,
     author = {V. A. Evstigneev and Y. Tursunbay kyzy},
     title = {On graph coloring in a~class of parallel local algorithms},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {231--243},
     publisher = {mathdoc},
     volume = {14},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2011_14_3_a0/}
}
TY  - JOUR
AU  - V. A. Evstigneev
AU  - Y. Tursunbay kyzy
TI  - On graph coloring in a~class of parallel local algorithms
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2011
SP  - 231
EP  - 243
VL  - 14
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2011_14_3_a0/
LA  - ru
ID  - SJVM_2011_14_3_a0
ER  - 
%0 Journal Article
%A V. A. Evstigneev
%A Y. Tursunbay kyzy
%T On graph coloring in a~class of parallel local algorithms
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2011
%P 231-243
%V 14
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2011_14_3_a0/
%G ru
%F SJVM_2011_14_3_a0
V. A. Evstigneev; Y. Tursunbay kyzy. On graph coloring in a~class of parallel local algorithms. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 14 (2011) no. 3, pp. 231-243. http://geodesic.mathdoc.fr/item/SJVM_2011_14_3_a0/