Key points are not available for this paper at this time.
We describe a novel randomized method. the method of cobm-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a gwen graph G = ( 1', E). The randomized algorithms obtained using this method can be derandomlzcd using kmihes of petfect hash f~wtctmns. Using the color-coding method we obtain. m particular, the following new results:
Alon et al. (1995) studied this question.