From: nikl+sm000849@mathematik.tu-muenchen.de (Gerhard Niklasch)
Subject: Re: extraction of cycles in a graph
Date: 12 Oct 2000 18:13:07 GMT
Newsgroups: sci.math
Summary: [missing]

Graeme Chambers <chambegs@cs.curtin.edu.au> wrote:
>  This is likely to be a simple question, but...
>
>  Does anyone know an algorithm (or C/C++ would be good too) to detect
>all the cycles/circuits in a graph.

K. Paton, An algorithm for Finding a Fundamental Set of Cycles
of a Graph

Communications of the ACM 12 (1969), 514 - 518

(NB1 Searching e.g. on www.google.com for "Paton" and "Fundamental"
and "Cycles" will lead you to some more recent work quoting that
article)

(NB2 if you can't get hold of old CACM volumes, you can order a copy
online.  www.acm.org and follow the obvious links.  Transmission by
email, the copy scanned into a PDF file ready for printing from Acro-
bat Reader, is easy and speedy and will set you back about US$10.)

Enjoy, Gerhard