Cole–Vishkin algorithm
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges share the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.
Vertex coloring is the starting point of the subject, and other coloring problems can be transformed into a vertex version. For example, an edge coloring of a graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual. However, non-vertex coloring problems are often stated and studied as is. That is partly for perspective, and partly because some problems are best studied in non-vertex form, as for instance is edge coloring.
The convention of using colors originates from coloring the countries of a map, where each face is literally colored. This was generalized to coloring the faces of a graph embedded in the plane. By planar duality it became coloring the vertices, and in this form it generalizes to all graphs. In mathematical and computer representations, it is typical to use the first few positive or nonnegative integers as the "colors". In general, one can use any finite set as the "color set". The nature of the coloring problem depends on the number of colors but not on what they are.
Graph coloring enjoys many practical applications as well as theoretical challenges. Beside the classical types of problems, different limitations can also be set on the graph, or on the way a color is assigned, or even on the color itself. It has even reached popularity with the general public in the form of the popular number puzzle Sudoku. Graph coloring is still a very active field of research.
Note: Many terms used in this article are defined in Glossary of graph theory.

This is an excerpt from the article Cole–Vishkin algorithm from the Wikipedia free encyclopedia. A list of authors is available at Wikipedia.
The article Cole–Vishkin algorithm at en.wikipedia.org was accessed 87 times in the last 30 days. (as of: 06/06/2014)
Images on Cole–Vishkin algorithm
Preview image:
Original:
Search results from Google and Bing
1
>30
1
Graph coloring - Wikipedia, the free encyclopedia
Hence the result by Cole and Vishkin raised the question of whether there is a constant-time distribute algorithm for 3-coloring an n-cycle. Linial (1992) showed  ...
en.wikipedia.org/wiki/Graph_coloring
2
>30
2
Uzi Vishkin - Wikipedia, the free encyclopedia
In the field of parallel and distributed algorithms, one of the seminal papers co- authored by Uzi Vishkin is Cole & Vishkin ...
en.wikipedia.org/wiki/Uzi_Vishkin
3
>30
3
File:Cole-Vishkin Algorithm Pseudo Code.jpg - Wikimedia Commons
Apr 21, 2013 ... File:Cole-Vishkin Algorithm Pseudo Code.jpg. From Wikimedia Commons ... Algorithm Pseudo Code.jpg. English: Cole and Vishkin Algorithm.
commons.wikimedia.org/wiki/File:Cole-Vishkin_Algorithm_Pseudo_Code.jpg
4
>30
4
Distributed Algorithms for Graph coloring
O(log*n) coloring of a tree. Cole & Vishkin's algorithm. Log*(n) is the smallest number of log-‐opera ons needed to bring n down to ≤2. For example, let n = one ...
www.divms.uiowa.edu/~ghosh/color.pdf
5
>30
5
DDA 2010, lecture 2
DDA 2010, lecture 2: Algorithms with running time O(log* n). • Cole–Vishkin ( 1986): • colour reduction technique. • colouring paths, cycles, trees. • Applications :.
www.cs.helsinki.fi/u/josuomel/dda-2010/lecture-2.pdf
6
>30
6
Distributed Algorithms for Channel Allocation
Cole and Vishkin Algorithm (1986) v u. For each vertex v in V, in each round R do . 1. if (R == 1) v.color = v.ID send v.color in downwards direction. 2. else.
www.cs.bgu.ac.il/~daca131/wiki.files/Lecture2.pdf
7
>30
7
Principles of Distributed Computing Solution 11
In the normal Cole-Vishkin algorithm, a node w always considers just one, say, its clockwise neighbor v when computing its new identifier idw. Node v computes ...
www.disco.ethz.ch/lectures/fs08/distcomp/exercises/solution11.pdf
8
>30
8
Thinking in Parallel: Some Basic Data-Parallel Algorithms and ...
www.umiacs.umd.edu/users/vishkin/XMT and the class home page. Comments are ... 3.2 Recursive Presentation of the Prefix-Sums Algorithm . . . . . . . . . . . 22.
www.umiacs.umd.edu/~vishkin/PUBLICATIONS/classnotes.pdf
9
>30
9
Local Algorithms: Self-Stabilization on Speed - People - MIT
In the Cole–Vishkin algorithm, the local input of a node is a unique identifier with O(log n) bits, and the local output of a node will be a color from the set {0, 1, 2}:.
people.csail.mit.edu/clenzen/pubs/LSW09local.pdf
10
>30
10
Cole-vishkin Algorithm Photos, Cole-vishkin Algorithm - Search
http://www.colehaan.com. Shop the Latest Looks of the Belt ...
feed.snapdo.com/?publisher=Minutes&dpid=network2&q=Cole-Vishkin_algorithm
Search results for "Cole–Vishkin algorithm"
Cole–Vishkin algorithm in science
Uzi Vishkin - Wikipedia, the free encyclopedia
Uzi Vishkin (born 1953) is a computer scientist at the University of Maryland, .... The Cole–Vishkin algorithm finds a vertex colouring in an n-cycle in O(log* n) ...
Graph coloring - Wikipedia, the free encyclopedia
4.1 Polynomial time; 4.2 Exact algorithms; 4.3 Contraction; 4.4 Greedy coloring ... at University College, who mentioned it in a letter to William Hamilton in 1852. ..... Richard Cole and Uzi Vishkin show that there is a distributed algorithm that ...
Uzi Vishkin - University of Maryland Institute for Advanced Computer ...
Citation: One of the pioneers of parallel algorithms research, Dr. Vishkin's seminal contributions played a leading role in forming and shaping what thinking in ...
List of Publications, Uzi Vishkin - University of Maryland Institute for ...
Fast parallel and serial approximate string matching. J. of Algorithms 10 (1989), 157-169. R. Cole and U. Vishkin. Faster optimal prefix sums and list ranking.
[PDF]Thinking in Parallel: Some Basic Data-Parallel Algorithms and ...
www.umiacs.umd.edu/users/vishkin/XMT and the class home page. Comments are ... 3.2 Recursive Presentation of the Prefix-Sums Algorithm . . . . . . . . . . . 22.
Uzi Vishkin - University of Maryland Institute for Advanced Computer ...
His initial focus was on parallel algorithms and parallel ...
Deterministic coin tossing and accelerating cascades: micro and ...
R. Cole and U. Vishkin, "Efficient parallel graph algorithms", in preparation. ... The Complexity of Parallel Computations, Cornell University, Ithaca, NY, 1979 ...
Deterministic parallel list ranking - Springer
The algorithm matches the performance of the Cole-Vishkin [CV86a] algorithm ... Department of Computer Science, University of Southern California, 90089, Los ...
[PDF]A Simple Randomized Parallel Algorithm for _ List-Ranking
optimal list-ranking algorithm did not exist. The Cole-Vishkin algorithm is an extremely. “Department of Computer Science, Flt-35, University of Washington, ...
[PDF]Deterministic Parallel List Ranking. - School of Computer Science
The algorithm matches the performance of theCole—Vishkin ... tI'lepartl'nent of Computer Science, University of Southern California, Los Angeles, California.
Books on the term Cole–Vishkin algorithm
Algorithm Theory - SWAT '92: Third Scandinavian Workshop on ...
Otto Nurmi, Esko Ukkonen, 1992
[Chin-78] F.Y. Chin, "An O(n) algorithm for determining a near-optimal computation order of matrix chain products", Communications of the ACM, Vol. 21 , No. 7, 1978, pp. 544-549. [CV-88] R. Cole, U. Vishkin, "Optimal parallel algorithms for ...
Handbook of Theoretical Computer Science: Algorithms and ...
Jan Leeuwen, 1990
[54] COLE, R. and M.T. GOODRICH, Optimal parallel algorithms for polygon and point-set problems, in: Proc. 4th Ann. ACM Conf. on Computational Geometry ( 1988) 201-210. [55] COLE, R. and U. VISHKIN, Deterministic coin tossing with ...
Stabilization, Safety, and Security of Distributed Systems: ...
Rachid Guerraoui, Franck Petit, 2009
Westartwith a variant ofavery fast andelegantalgorithm, the well-known Cole–Vishkin algorithm [4], which 3-colors an n-cycle in O(log∗ n) rounds.The function log∗ n isdefined as the number oftimes the logarithm has to be applied to n until the ...
Parallel Computing Using the Prefix Problem
S. Lakshmivarahan, 1994
The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operatio...
Handbook of Computational Geometry
J.R. Sack, J. Urrutia, 1999
R. Cole, M.T. Goodrich and C. 0'Diinlaing, A nearly optimal deterministic parallel Voronoi diagram algorithm, Algorithmica 16 (1996), 569-617. R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree and ...
Proceedings of the Fifth Annual ACM-SIAM Symposium on ...
1994
[6] Omer Berkman, Baruch Schieber, and Uzi Vishkin. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms, 14:344-370, 1993. [7] Richard Cole and Uzi Vishkin. Faster optimal ...

Blog posts on the term
Cole–Vishkin algorithm
Distributed computing2: Distributed algorithms
The blueprint G is the anatomy of the computer network. There is one computer for anniversary bulge of G and one advice articulation for anniversary bend of G.
distributeddcomputing.blogspot.com/2011/12/distributed-algorithms.html
Andre's Post: Apa Yang di maksud Distribute System ?
Distributed computing is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network.
akuandre-tekomc.blogspot.com/2010/11/apa-yang-di-maksud-distribute-system.html
Algorithms for Molecular Biology | Full text | A basic analysis toolkit for biological sequences
This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory and practice by providing an extensible and easy to use software library that includes algorithms for the mentioned string matching and alignment problems. The library consists of C/C++ library functions as well as Perl library functions. It can be interfaced with Bioperl and can also be used as a stand-alone system with a GUI. The software is available at http://www.math.unipa.it/~raffaele/BATS/ under the GNU GPL.
www.almob.org/content/2/1/10
my slice of pizza: Workshop: Parallelism 2020
I was at the DIMACS Workshop on parallelism: 2020 vision. I looked forward to the workshop and as expected, problems and challenges that were discussed were reminiscent of early 1990's,; the keywords however were not interconnection machines, grids or hypercubes but mapreduce and multicores.
mysliceofpizza.blogspot.com/2011/03/workshop-parallelism-2020.html
Download The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time book @ Ritalin effects on liver enzymes :: 痞客邦 PIXNET ::
Book: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logar
sandgasubs1985.pixnet.net/blog/post/223913093
Distributed computing | High Performance Computing & Security in Computing
Distributed computing Distributed computing is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal. A computer program that runs in a distributed system is called a distributed program,…
manesht.wordpress.com/2009/07/18/distributed-computing/