Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs

Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classical problem of listing cycles, we study how to list chordless cycles. The best known solution to list all the C chordless cycles contained in an undirected graph G = (V,E) takes O(|E|2 + |E| ·C) time. In this paper we provide an algorithm taking \(\tilde{O}(|E| + |V| \cdot C)\) time. We also show how to obtain the same complexity for listing all the P chordless st-paths in G (where C is replaced by P).

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

[2]  Ulrich Ultes-Nitsche,et al.  Identification of Chordless Cycles in Ecological Networks , 2012, Complex.

[3]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[4]  M. Conforti,et al.  Finding an even hole in a graph , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5]  Bruce M. Kapron,et al.  Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.

[6]  Gérard Cornuéjols,et al.  Recognizing balanced 0,±matrices , 1994, SODA '94.

[7]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[8]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

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

[10]  Roberto Grossi,et al.  Optimal Listing of Cycles and st-Paths in Undirected Graphs , 2012, SODA.

[11]  Yijia Chen,et al.  On Parameterized Path and Chordless Path Problems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[12]  Michele Conforti,et al.  Structural properties and decomposition of linear balanced matrices , 1992, Math. Program..

[13]  Maciej M. Syslo,et al.  An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph , 1981, SIAM J. Comput..

[14]  Michael Hoffmann,et al.  Chordless paths through three vertices , 2004, Theor. Comput. Sci..

[15]  Takeaki Uno,et al.  Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs , 1997, ISAAC.

[16]  Ken-ichi Kawarabayashi,et al.  The Induced Disjoint Paths Problem , 2008, IPCO.