Abstract
In the last few years the studies on complex networks have gained extensive research interests. Significant impacts are made by these studies on a wide range of different areas including social networks, technology networks, biological networks and others. Motivated by understanding the structure of ecological networks we introduce in this paper a new algorithm for enumerating all chordless cycles. The proposed algorithm is a recursive one based on the depth-first search.
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
Cohen, J.: Food Webs and Niche Space. Princeton University Press, Princeton (1978)
Sugihara, G.: Niche Hierarchy: Structure Assembly and Organization in Natural Communities. PhD thesis, Princeton University, Princeton (1982)
Cohen, J., Briand, F., Newman, C.: Community Food Webs, Data and Theory. Springer (1990)
Bersier, L.F., Baltensperger, R., Gabriel, J.P.: Why are cordless cycles so common in niche overlap graphs? In: Ecological Society of America, Annual Meeting, p. 76 (2002)
Huxham, M., Beaney, S., Raffaelli, D.: Do parasites reduce the changes of triangulation in a real food web? Oikos 76, 284–300 (1996)
Golumbic, M.: Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier (2004)
Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5, 90–99 (1976)
Tiernan, J.: An efficient search algorithm to find the elementary circuits of a graph. Communications of the ACM 13, 722–726 (1970)
Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput. 2, 211–216 (1973)
Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: AICT/ICIW, pp. 57–59 (2006)
Sankar, K., Sarad, A.: A time and memory efficient way to enumerate cycles in a graph. In: ICIAS, pp. 498–500 (2007)
Johnson, D.: Find all the elementary circuits of a directed graph. SIAM J. Comput. 4, 77–84 (1977)
Spinrad, J.: Finding large holes. Inform. Process. Lett. 39, 227–229 (1991)
Nikolopoulos, S., Palios, L.: Hole and antihole detection in graphs. In: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pp. 843–852 (2004)
Hayward, R.: Weakly triangulated graphs. J. Combinatorial Theory Series B 39, 200–208 (1985)
Bisdorff, R.: On enumerating chordless circuits in directed graphs, http://charles-sanders-peirce.uni.lu/bisdorff/documents/chordlessCircuits.pdf
Epp, S.: Discrete mathematics with applications, 2nd edn. Brooks/Cole Publishing Company (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sokhn, N., Baltensperger, R., Bersier, LF., Hennebert, J., Ultes-Nitsche, U. (2013). Identification of Chordless Cycles in Ecological Networks. In: Glass, K., Colbaugh, R., Ormerod, P., Tsao, J. (eds) Complex Sciences. Complex 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 126. Springer, Cham. https://doi.org/10.1007/978-3-319-03473-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-03473-7_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03472-0
Online ISBN: 978-3-319-03473-7
eBook Packages: Computer ScienceComputer Science (R0)