{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:47:40Z","timestamp":1777178860600,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf02523189","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T04:41:28Z","timestamp":1162960888000},"page":"209-223","source":"Crossref","is-referenced-by-count":359,"title":["Finding and counting given length cycles"],"prefix":"10.1007","volume":"17","author":[{"given":"N.","family":"Alon","sequence":"first","affiliation":[]},{"given":"R.","family":"Yuster","sequence":"additional","affiliation":[]},{"given":"U.","family":"Zwick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02523189_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles.Proceedings of the 2nd European Symposium on Algorithms, Utrecht, Lecture Notes in Computer Science, Vol. 855, pages 354\u2013364. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049422"},{"key":"BF02523189_CR2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"N. Alon, R. Yuster, and U. Zwick. Color-coding.Journal of the ACM, 42:844\u2013856, 1995.","journal-title":"Journal of the ACM"},{"key":"BF02523189_CR3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1965","unstructured":"B. Bollob\u00e1s. On generalized graphs.Acta Mathematica Academiae Scientarium Hungaricae, 16:447\u2013452, 1965.","journal-title":"Acta Mathematica Academiae Scientarium Hungaricae"},{"key":"BF02523189_CR4","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s.Extremal Graph Theory. Academic Press, New York, 1978."},{"key":"BF02523189_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J. A. Bondy","year":"1974","unstructured":"J. A. Bondy and M. Simonovits. Cycles of even length in graphs.Journal of Combinatorial Theory, Series B, 16:97\u2013105, 1974.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02523189_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms.SIAM Journal on Computing, 14:210\u2013223, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"BF02523189_CR7","unstructured":"D. Eppstein. Subgraph isomorphism in planar graphs and related problems.Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pages 632\u2013640, 1995."},{"key":"BF02523189_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"A. Itai and M. Rodeh. Finding a minimum circuit in a graph.SIAM Journal on Computing, 7:413\u2013423, 1978.","journal-title":"SIAM Journal on Computing"},{"key":"BF02523189_CR9","unstructured":"T. Kloks, D. Kratsch, and H. M\u00fcller. Finding and counting small induced subgraphs efficiently.Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, Aachen, Lecture Notes in Computer Sciences Vol. 1017, pages 14\u201323. Springer-Verlag, 1995."},{"key":"BF02523189_CR10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D. W. Matula","year":"1983","unstructured":"D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms.Journal of the ACM, 30:417\u2013427, 1983.","journal-title":"Journal of the ACM"},{"key":"BF02523189_CR11","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"B. Monien. How to find long paths efficiently.Annals of Discrete Mathematics, 25:239\u2013254, 1985.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"BF02523189_CR12","first-page":"415","volume":"26","author":"J. Ne\u0161et\u0159il","year":"1985","unstructured":"J. Ne\u0161et\u0159il and S. Poljak. On the complexity of the subgraph problem.Commentationes Mathematicae Universitatis Carolinae, 26(2):415\u2013419, 1985.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"BF02523189_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C. H. Papadimitriou","year":"1981","unstructured":"C. H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs.Information Processing Letters, 13:131\u2013133, 1981.","journal-title":"Information Processing Letters"},{"key":"BF02523189_CR14","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0196-6774(86)90029-5","volume":"7","author":"D. Richards","year":"1986","unstructured":"D. Richards. Finding short cycles in a planar graph using separators.Journal of Algorithms, 7:382\u2013394, 1986.","journal-title":"Journal of Algorithms"},{"key":"BF02523189_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/net.3230250404","volume":"25","author":"G. Sundaram","year":"1995","unstructured":"G. Sundaram and S. S. Skiena. Recognizing small subgraphs.Networks, 25:183\u2013191, 1995.","journal-title":"Networks"},{"key":"BF02523189_CR16","series-title":"Jerusalem, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/3-540-58201-0_96","volume-title":"Proceedings of the 21st International Colloquium on Automata, Languages and Programming","author":"R. Yuster","year":"1994","unstructured":"R. Yuster and U. Zwick. Finding even cycles even faster.Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Lecture Notes in Computer Science, Vol. 820, pages 532\u2013543, Springer-Verlag, Berlin, 1994. Journal version to appear inSIAM Journal on Discrete Mathematics."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523189.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02523189\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:39:41Z","timestamp":1558298381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02523189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF02523189"],"URL":"https:\/\/doi.org\/10.1007\/bf02523189","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}