{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:20:10Z","timestamp":1771024810686,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":[[1994,12]]},"DOI":"10.1016\/0020-0190(94)00151-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"249-252","source":"Crossref","is-referenced-by-count":23,"title":["Algorithms to count paths and cycles"],"prefix":"10.1016","volume":"52","author":[{"given":"Eric T.","family":"Bax","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0190(94)00151-0_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","article-title":"Inclusion and exclusion algorithm for the Hamiltonian path problem","volume":"27","author":"Bax","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00151-0_BIB2","unstructured":"E.T. Bax, Improvements and bounding for the inclusion and exclusion Hamiltonian algorithm, Caltech-CS-TR-94-11."},{"key":"10.1016\/0020-0190(94)00151-0_BIB3","series-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/0020-0190(94)00151-0_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","article-title":"Dynamic programming meets the principle of inclusion and exclusion","volume":"1","author":"Karp","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(94)00151-0_BIB5","series-title":"Carus Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440147","volume":"14","author":"Ryser","year":"1963"},{"issue":"3","key":"10.1016\/0020-0190(94)00151-0_BIB6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/0202017","article-title":"Enumeration of the elementary circuits of a directed graph","volume":"2","author":"Tarjan","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(94)00151-0_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0020-0190(94)00151-0_BIB8","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T21:41:14Z","timestamp":1621028474000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0020019094001510"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00151-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}