A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
نویسنده
چکیده
Suppose that n processors are arranged in a ring and can communicate only with their immediate neighbors. We show 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 [CV] and extends the lower bound for deterministic algorithms of Linial [L].
منابع مشابه
A new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملOn the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound
Maximum Clique Problem(MCP) is one of the 21 original NP -complete problems enumerated by Karp[19] in 1972. In the last years a large number of exact methods to solve MCP have been appeared[2, 3, 6, 8, 9, 13, 14,17,18,21,23,25,29-31,34-38,40-43]. Most of them are branch and bound algorithms and use branching rule introduced by Balas and Yu[3] and based on coloring heuristics to establish an upp...
متن کاملLower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive
The van der Waerden number W (k, 2) is the smallest integer n such that every 2-coloring of 1 to n has a monochromatic arithmetic progression of length k. The existence of such an n for any k is due to van der Waerden but known upper bounds on W (k, 2) are enormous. Much effort was put into developing lower bounds on W (k, 2). Most of these lower bound proofs employ the probabilistic method oft...
متن کاملColoring k-colorable graphs using relatively small palettes
We obtain the following new coloring results: A 3-colorable graph on n vertices with maximum degree can be colored, in polynomial time, using O(( log ) 1=3 logn) colors. This slightly improves an O(( 1=3 log ) logn) bound given by Karger, Motwani and Sudan. More generally, k-colorable graphs with maximum degree can be colored, in polynomial time, using O(( 1 2=k log ) logn) colors. A 4-colorabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 4 شماره
صفحات -
تاریخ انتشار 1991