{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:26:52Z","timestamp":1725460012811},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584346"},{"type":"electronic","value":"9783540487944"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0049422","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T13:42:35Z","timestamp":1141652555000},"page":"354-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Finding and counting given length cycles"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, R. Yuster, and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Canada, pages 326\u2013335, 1994.","DOI":"10.1145\/195058.195179"},{"key":"32_CR2","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 Math. Acad. Sci. Hungar., 16:447\u2013452, 1965.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s. Extremal graph theory. Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"32_CR4","doi-asserted-by":"publisher","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":"32_CR5","doi-asserted-by":"publisher","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":"32_CR6","doi-asserted-by":"publisher","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":"32_CR7","doi-asserted-by":"publisher","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":"32_CR8","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":"32_CR9","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":"32_CR10","doi-asserted-by":"publisher","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":"32_CR11","doi-asserted-by":"publisher","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":"32_CR12","doi-asserted-by":"crossref","unstructured":"R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, 1994. To appear.","DOI":"10.1007\/3-540-58201-0_96"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:50:47Z","timestamp":1578498647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049422"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0049422","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"23 February 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}