{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:59:18Z","timestamp":1767841158951,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319034720","type":"print"},{"value":"9783319034737","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03473-7_28","type":"book-chapter","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T14:57:26Z","timestamp":1383749846000},"page":"316-324","source":"Crossref","is-referenced-by-count":5,"title":["Identification of Chordless Cycles in Ecological Networks"],"prefix":"10.1007","author":[{"given":"Nayla","family":"Sokhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Baltensperger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-F\u00e9lix","family":"Bersier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Hennebert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Ultes-Nitsche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Food Webs and Niche Space","author":"J. Cohen","year":"1978","unstructured":"Cohen, J.: Food Webs and Niche Space. Princeton University Press, Princeton (1978)"},{"key":"28_CR2","unstructured":"Sugihara, G.: Niche Hierarchy: Structure Assembly and Organization in Natural Communities. PhD thesis, Princeton University, Princeton (1982)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, J., Briand, F., Newman, C.: Community Food Webs, Data and Theory. Springer (1990)","DOI":"10.1007\/978-3-642-83784-5"},{"key":"28_CR4","unstructured":"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)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"284","DOI":"10.2307\/3546201","volume":"76","author":"M. Huxham","year":"1996","unstructured":"Huxham, M., Beaney, S., Raffaelli, D.: Do parasites reduce the changes of triangulation in a real food web? Oikos\u00a076, 284\u2013300 (1996)","journal-title":"Oikos"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.: Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/0205007","volume":"5","author":"P. Mateti","year":"1976","unstructured":"Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM J. Comput.\u00a05, 90\u201399 (1976)","journal-title":"SIAM J. Comput."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"J. Tiernan","year":"1970","unstructured":"Tiernan, J.: An efficient search algorithm to find the elementary circuits of a graph. Communications of the ACM\u00a013, 722\u2013726 (1970)","journal-title":"Communications of the ACM"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R. Tarjan","year":"1973","unstructured":"Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput.\u00a02, 211\u2013216 (1973)","journal-title":"SIAM J. Comput."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: AICT\/ICIW, pp. 57\u201359 (2006)","DOI":"10.1109\/AICT-ICIW.2006.22"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Sankar, K., Sarad, A.: A time and memory efficient way to enumerate cycles in a graph. In: ICIAS, pp. 498\u2013500 (2007)","DOI":"10.1109\/ICIAS.2007.4658438"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D. Johnson","year":"1977","unstructured":"Johnson, D.: Find all the elementary circuits of a directed graph. SIAM J. Comput.\u00a04, 77\u201384 (1977)","journal-title":"SIAM J. Comput."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(91)90184-J","volume":"39","author":"J. Spinrad","year":"1991","unstructured":"Spinrad, J.: Finding large holes. Inform. Process. Lett.\u00a039, 227\u2013229 (1991)","journal-title":"Inform. Process. Lett."},{"key":"28_CR14","unstructured":"Nikolopoulos, S., Palios, L.: Hole and antihole detection in graphs. In: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pp. 843\u2013852 (2004)"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R. Hayward","year":"1985","unstructured":"Hayward, R.: Weakly triangulated graphs. J. Combinatorial Theory Series B\u00a039, 200\u2013208 (1985)","journal-title":"J. Combinatorial Theory Series B"},{"key":"28_CR16","unstructured":"Bisdorff, R.: On enumerating chordless circuits in directed graphs, http:\/\/charles-sanders-peirce.uni.lu\/bisdorff\/documents\/chordlessCircuits.pdf"},{"key":"28_CR17","unstructured":"Epp, S.: Discrete mathematics with applications, 2nd edn. Brooks\/Cole Publishing Company (1995)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Complex Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03473-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T19:41:51Z","timestamp":1746042111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03473-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319034720","9783319034737"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03473-7_28","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}