A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Color-coding
1995
Journal of the ACM
We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V, E). The randomized algorithms obtained using this method can be derandomized using families of perfect hash functions. Using the color-coding method we obtain, in particular, the following new results: • For every fixed k, if a graph G = (V, E) contains a simple cycle of size exactly k, then such a cycle can be
doi:10.1145/210332.210337
fatcat:xcxlixjrcbbrxkgn2lamsijyke