{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T16:21:56Z","timestamp":1748362916507},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0020-0190(03)00252-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"13-15","source":"Crossref","is-referenced-by-count":6,"title":["Detecting directed 4-cycles still faster"],"prefix":"10.1016","volume":"87","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(03)00252-7_BIB001","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0020-0190(03)00252-7_BIB002","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","article-title":"Finding and counting given length cycles","volume":"17","author":"Alon","year":"1997","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0020-0190(03)00252-7_BIB003","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"10.1016\/S0020-0190(03)00252-7_BIB004","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jcom.1998.0476","article-title":"Fast rectangular matrix multiplication and applications","volume":"14","author":"Huang","year":"1998","journal-title":"J. Complexity"},{"issue":"4","key":"10.1016\/S0020-0190(03)00252-7_BIB005","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","article-title":"Finding a minimum circuit in a graph","volume":"7","author":"Itai","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"10.1016\/S0020-0190(03)00252-7_BIB006","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","article-title":"Finding and counting small induced subgraphs efficiently","volume":"74","author":"Kloks","year":"2000","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(03)00252-7_BIB007","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/S0895480194274133","article-title":"Finding even cycles even faster","volume":"10","author":"Yuster","year":"1997","journal-title":"SIAM J. Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:58:16Z","timestamp":1553173096000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0020019003002527"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00252-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}