We describe a novel randomized method, the method of
{\em 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 {\em perfect hash functions\/}. ... more >>>