{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:52:07Z","timestamp":1777614727277,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662447765","type":"print"},{"value":"9783662447772","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_35","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"418-429","source":"Crossref","is-referenced-by-count":8,"title":["Amortized $\\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Rui","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Sacomoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Birmel\u00e9, E., Ferreira, R.A., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal listing of cycles and st-paths in undirected graphs. In: SODA 2013, pp. 1884\u20131896. ACM\/SIAM (2013)","DOI":"10.1137\/1.9781611973105.134"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: IEEE Conference on Computational Complexity, pp. 250\u2013263 (2007)","DOI":"10.1109\/CCC.2007.21"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a0164, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"key":"35_CR4","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vuskovic, K.: Recognizing balanced 0, +\/- matrices. In: SODA 1994, pp. 103\u2013111. ACM\/SIAM (1994)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vuskovic, K.: Finding an even hole in a graph. In: FOCS 1997, pp. 480\u2013485. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646136"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01581196","volume":"55","author":"M. Conforti","year":"1992","unstructured":"Conforti, M., Rao, M.R.: Structural properties and decomposition of linear balanced matrices. Math. Program.\u00a055, 129\u2013168 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.tcs.2005.10.021","volume":"351","author":"R. Haas","year":"2006","unstructured":"Haas, R., Hoffmann, M.: Chordless paths through three vertices. Theoretical Computer Science\u00a0351(3), 360\u2013371 (2006)","journal-title":"Theoretical Computer Science"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Kapron, B.M., King, V., Mountjoy, B.: Dynamic graph connectivity in polylogarithmic worst case time. In: SODA, pp. 1131\u20131142 (2013)","DOI":"10.1137\/1.9781611973105.81"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I., Kobayashi, Y.: The induced disjoint paths problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 47\u201361. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68891-4_4"},{"issue":"3","key":"35_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"C. Read","year":"1975","unstructured":"Read, C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks\u00a05(3), 237\u2013252 (1975)","journal-title":"Networks"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D. Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatorial Theory, Series B\u00a016(2), 191\u2013193 (1974)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"35_CR12","series-title":"LNICST","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-319-03473-7_28","volume-title":"Complex Sciences","author":"N. Sokhn","year":"2013","unstructured":"Sokhn, N., Baltensperger, R., Bersier, L.-F., Hennebert, J., Ultes-Nitsche, U.: Identification of chordless cycles in ecological networks. In: Glass, K., Colbaugh, R., Ormerod, P., Tsao, J. (eds.) Complex 2012. LNICST, vol.\u00a0126, pp. 316\u2013324. Springer, Heidelberg (2013)"},{"issue":"4","key":"35_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/0210062","volume":"10","author":"M. Maciej","year":"1981","unstructured":"Maciej, M.: Syslo. An efficient cycle vector space algorithm for listing all cycles of a planar graph. SIAM J. Comput.\u00a010(4), 797\u2013808 (1981)","journal-title":"SIAM J. Comput."},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-63890-3_11","volume-title":"Algorithms and Computation","author":"T. Uno","year":"1997","unstructured":"Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 92\u2013101. Springer, Heidelberg (1997)"},{"key":"35_CR15","unstructured":"Uno, T.: An output linear time algorithm for enumerating chordless cycles. In: 92nd SIGAL of Information Processing Society Japan, pp. 47\u201353 (2003) (in Japanese)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jda.2007.01.005","volume":"6","author":"M. Wild","year":"2008","unstructured":"Wild, M.: Generating all cycles, chordless cycles, and hamiltonian cycles with the principle of exclusion. J. of Discrete Algorithms\u00a06(1), 93\u2013102 (2008)","journal-title":"J. of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T07:34:15Z","timestamp":1746344055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}