| | |
Summary: Color-coding: a new method for finding simple paths, cycles
and other small subgraphs within large graphs
(Extended Abstract)
Noga Alon
Institute for Advanced Study
and Tel Aviv University
Raphy Yuster
Dept. of Computer Science
Tel Aviv University
Uri Zwick
Dept. of Computer Science
Tel Aviv University
Abstract
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
|
