A LOWER BOUND ON PROBABILISTIC ALGORITHMS FOR DISTRIBUTIVE RING COLORING

被引：72
|
作者：
NAOR, M
机构：
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1991年 / 4卷 / 03期
关键词：
DISTRIBUTED COMPUTATION; PROBABILISTIC ALGORITHMS; GRAPH COLORING;
D O I：
10.1137/0404036
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Suppose that n processors are arranged in a ring and can communicate only with their immediate neighbors. It is shown that any probabilistic algorithm for 3 coloring the ring must take at least 1/2 log * n - 2 rounds, otherwise the probability that all processors are colored legally is less than 1/2. A similar time bound holds for selecting a maximal independent set. The bound is tight (up to a constant factor) in light of the deterministic algorithms of Cole and Vishkin [Inform. and Control, 70 (1986), pp. 32-53] and extends the lower bound for deterministic algorithms of Linial [Proc. 28th IEEE Foundations of Computer Science Symposium, 1987, pp. 331-335].
引用
收藏
页码：409 / 412
页数：4
相关论文
共 50 条
  • [1] A LOWER BOUND FOR PROBABILISTIC DISTRIBUTED ALGORITHMS
    PACHL, JK
    JOURNAL OF ALGORITHMS, 1987, 8 (01) : 53 - 65
  • [2] A LOWER BOUND FOR PROBABILISTIC ALGORITHMS FOR FINITE STATE MACHINES
    GREENBERG, AG
    WEISS, A
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 33 (01) : 88 - 105
  • [3] A lower bound technique for radio κ-coloring
    Das, Sandip
    Ghosh, Sasthi C.
    Nandi, Soumen
    Sen, Sagnik
    DISCRETE MATHEMATICS, 2017, 340 (05) : 855 - 861
  • [4] PROBABILISTIC ANALYSIS OF GRAPH-COLORING ALGORITHMS
    MARCHETTISPACCAMELA, A
    TALAMO, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 159 : 332 - 340
  • [5] A lower bound for set-coloring Ramsey numbers
    Aragao, Lucas
    Collares, Mauricio
    Marciano, Joao Pedro
    Martins, Taisa
    Morris, Robert
    RANDOM STRUCTURES & ALGORITHMS, 2024, 64 (02) : 157 - 169
  • [6] New Lower Bound for the Minimum Sum Coloring Problem
    Lecat, Clement
    Lucet, Corinne
    Li, Chu-Min
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 853 - 859
  • [7] IMPLEMENTATION AND OPTIMIZATION OF PROBABILISTIC AND MATHEMATICAL STATISTICAL ALGORITHMS UNDER DISTRIBUTIVE ARCHITECTURE
    Li, Shengbiao
    Peng, Jiankui
    SCALABLE COMPUTING-PRACTICE AND EXPERIENCE, 2024, 25 (05): : 3841 - 3849
  • [8] LOWER BOUND TECHNIQUES FOR VLSI ALGORITHMS
    HROMKOVIC, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 281 : 2 - 25
  • [9] A new lower bound for the on-line coloring of intervals with bandwidth
    Mikos, Patryk
    THEORETICAL COMPUTER SCIENCE, 2018, 708 : 96 - 100
  • [10] Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph
    Rozovskaya, A. P.
    Shabanov, D. A.
    MATHEMATICAL NOTES, 2011, 89 (5-6) : 903 - 906
12345