Efficient Enumeration of All Chordless Cycles in Graphs

Enumerating chordless cycles is a theoretical important problem in the Graph Theory area. It also can be applied to practical problems, such as discover which predators compete for the same food in ecological networks. Motivated by theoretical interest of the problem and also by its significant practical importance, we show in this paper a new algorithm to enumerate all chordless cycles in undirected graphs. The proposed algorithm is recursive and based on the depth-first search strategy. It is linear in the number of chordless paths.

[1]  John L. Pfaltz.  Chordless cycles in networks , 2013, 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW).

[2]  Robin Wilson,et al.  Graphs an Introductory Approach , 1990, The Mathematical Gazette.

[3]  Liping Sun.  Two classes of perfect graphs , 1991, J. Comb. Theory, Ser. B.

[4]  Leonidas Palios,et al.  Hole and antihole detection in graphs , 2004, SODA '04.

[5]  Marcel Wild,et al.  Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion , 2008, J. Discrete Algorithms.

[6]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[7]  Ryan B. Hayward,et al.  Weakly triangulated graphs , 1985, J. Comb. Theory B.

[8]  Jeremy P. Spinrad.  Finding Large Holes , 1991, Inf. Process. Lett..

[9]  P. J. Narayanan,et al.  Accelerating Large Graph Algorithms on the GPU Using CUDA , 2007, HiPC.

[10]  Takeaki Uno,et al.  An Output Linear Time Algorithm for Enumerating Chordless Cycles , 2003 .