Finding the shortest cycles in an undirected graph

Nov 18, 2008 at 5:56 PM
Hello,

I'm new to graph theory and am looking for an algorithm or method of finding all of the shortest cycles in an undirected graph.

If you can point me in the right direction I would appreciate it.

Thanks,
Nejat