Abstract
A chordless cycle (induced cycle) C of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the problems of enumerating chordless cycles/paths of a given graph G = (V,E), and propose algorithms taking O(|E|) time for each chordless cycle/path. In the existing studies, the problems had not been deeply studied in the theoretical computer science area, and no output polynomial time algorithm has been proposed. Our experiments showed that the computation time of our algorithms is constant per chordless cycle/path for non-dense random graphs and real-world graphs. They also show that the number of chordless cycles is much smaller than the number of cycles. We applied the algorithm to prediction of NMR (Nuclear Magnetic Resonance) spectra, and increased the accuracy of the prediction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asai, T., Arimura, H., Uno, T., Nakano, S.-I.: Discovering Frequent Substructures in Large Unordered Trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 47–61. Springer, Heidelberg (2003)
Balaban, A.T., Filip, P., Balaban, T.S.: Computer Program for Finding All Possible Cycles in Graphs. J. Comput. Chem. 6, 316–329 (1985)
Downs, G.M., Gillet, V.J., Holiday, J.D., Lynch, M.F.: Review of Ring Perception Algorithms for Chemical Graphs. J. Chem. Inf. Comp. Sci. 29, 172–187 (1989)
Downs, G.M.: Ring perception. In: The Encyclopedia of Computational Chemistry, vol. 4, John Wiley & Sons, Chichester (1998)
Eppstein, D.: Finding the k Smallest Spanning Trees. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 38–47. Springer, Heidelberg (1990)
Ferreira, R., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal Listing of Cycles and st-Paths in Undirected Graphs. In: SODA 2013 (2013)
Hanser, T., Jauffret, P., Gaufmann, G.: A New Algorithm for Exhaustive Ring Perception in a Molecular Graph. J. Chem. Inf. Comp. Sci. 36, 1146–1152 (1996)
Kapoor, S., Ramesh, H.: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27, 120–130 (2000)
Inokuchi, A., Washio, T., Motoda, H.: Complete Mining of Frequent Patterns from Graphs. Machine Learning 50, 321–354 (2003)
Makino, K., Uno, T.: New Algorithms for Enumerating All Maximal Cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260–272. Springer, Heidelberg (2004)
Parthasarathy, S., Zaki, M.J., Ogihara, M., Dwarkadas, S.: Incremental and Interactive Sequence Mining. In: CIKM 1999, pp. 251–258 (1999)
Read, R.C., Tarjan, R.E.: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. Networks 5, 237–252 (1975)
Tomita, E., Tanaka, A., Takahashi, H.: The Worst-case Time Complexity for Generating all Maximal Cliques and Computational Experiments. Theo. Comp. Sci. 363, 28–42 (2006)
Satoh, H., Koshino, H., Uno, T., Koichi, S., Iwata, S., Nakata, T.: Effective consideration of ring structures in CAST/CNMR for highly accurate 13C NMR chemical shift prediction. Tetrahedron 61, 7431–7437 (2005)
Satoh, H., Koshino, H., Uzawa, J., Nakata, T.: CAST/CNMR: Highly Accurate 13C NMR Chemical Shift Prediction System Considering Stereochemistry. Tetrahedron 59, 4539–4547 (2003)
UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/
Uno, T.: A Fast Algorithm for Enumerating Bipartite Perfect Matchings. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 367–379. Springer, Heidelberg (2001)
Uno, T.: An Output Linear Time Algorithm for Enumerating Chordless Cycles, IPSJ, SIG-AL 92 (2003) (in Japanese, technical report, non-refereed)
Wild, M.: Generating all Cycles, Chordless Cycles, and Hamiltonian Cycles with the Principle of Exclusion. J. Discrete Alg. 6, 93–102 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Uno, T., Satoh, H. (2014). An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. In: Džeroski, S., Panov, P., Kocev, D., Todorovski, L. (eds) Discovery Science. DS 2014. Lecture Notes in Computer Science(), vol 8777. Springer, Cham. https://doi.org/10.1007/978-3-319-11812-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-11812-3_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11811-6
Online ISBN: 978-3-319-11812-3
eBook Packages: Computer ScienceComputer Science (R0)