A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Color-coding

1994
*
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
*

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, among others, the following new results: * • If a graph G = (V, E) contains a subgraph isomorphic to a bounded tree-width graph H = (V H , E H ) where |V H

doi:10.1145/195058.195179
dblp:conf/stoc/AlonYZ94
fatcat:7escc6ce2nfmtowkqhrauzn3ae