{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:23Z","timestamp":1725664043447},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"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\/3-540-58201-0_96","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:34:23Z","timestamp":1330270463000},"page":"532-543","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Finding even cycles even faster"],"prefix":"10.1007","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"44_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, 1994.","DOI":"10.1145\/195058.195179"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s. Extremal graph theory. Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"44_CR3","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":"44_CR4","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":"44_CR5","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity, chapter 10, pages 525\u2013631. Elsevier and The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF02251238","volume":"31","author":"B. Monien","year":"1983","unstructured":"B. Monien. The complexity of determining a shortest cycle of even length. Computing, 31:355\u2013369, 1983.","journal-title":"Computing"},{"key":"44_CR7","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"},{"key":"44_CR8","first-page":"249","volume":"27","author":"D. Richards","year":"1985","unstructured":"D. Richards and A.L. Liestman. Finding cycles of a given length. Annals of Discrete Mathematics, 27:249\u2013256, 1985.","journal-title":"Annals of Discrete Mathematics"},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0195-6698(85)80025-1","volume":"6","author":"C. Thomassen","year":"1985","unstructured":"C. Thomassen. Even cycles in directed graphs. European Journal of Combinatorics, 6:85\u201389, 1985.","journal-title":"European Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:51:45Z","timestamp":1578527505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_96"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_96","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":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}