Identification of Chordless Cycles in Ecological Networks
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.
Keywordsecological networks community structure food webs niche-overlap graphs chordless cycles
Unable to display preview. Download preview PDF.
- 1.Cohen, J.: Food Webs and Niche Space. Princeton University Press, Princeton (1978)Google Scholar
- 2.Sugihara, G.: Niche Hierarchy: Structure Assembly and Organization in Natural Communities. PhD thesis, Princeton University, Princeton (1982)Google Scholar
- 3.Cohen, J., Briand, F., Newman, C.: Community Food Webs, Data and Theory. Springer (1990)Google Scholar
- 4.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)Google Scholar
- 6.Golumbic, M.: Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier (2004)Google Scholar
- 10.Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: AICT/ICIW, pp. 57–59 (2006)Google Scholar
- 11.Sankar, K., Sarad, A.: A time and memory efficient way to enumerate cycles in a graph. In: ICIAS, pp. 498–500 (2007)Google Scholar
- 14.Nikolopoulos, S., Palios, L.: Hole and antihole detection in graphs. In: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pp. 843–852 (2004)Google Scholar
- 16.Bisdorff, R.: On enumerating chordless circuits in directed graphs, http://charles-sanders-peirce.uni.lu/bisdorff/documents/chordlessCircuits.pdf
- 17.Epp, S.: Discrete mathematics with applications, 2nd edn. Brooks/Cole Publishing Company (1995)Google Scholar