{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:06:30Z","timestamp":1757311590873},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"financial support from the Royal Commission for the Exhibition of 1851"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1966-9","type":"journal-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T09:45:13Z","timestamp":1540460713000},"page":"1197-1202","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Simple Paths from Connected Induced Subgraphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Pierre-Louis","family":"Giscard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Rochet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"key":"1966_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"4","key":"1966_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"ET Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the hamiltonian path problem. Inf. Process. Lett. 47(4), 203\u2013207 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"1966_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)00151-0","volume":"52","author":"ET Bax","year":"1994","unstructured":"Bax, E.T.: Algorithms to count paths and cycles. Inf. Process. Lett. 52(5), 249\u2013252 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"1966_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0020-0190(96)00159-7","volume":"60","author":"E Bax","year":"1996","unstructured":"Bax, E., Franklin, J.: A finite-difference sieve to count paths and cycles by length. Inf. Process. Lett. 60(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"1966_CR5","first-page":"578","volume-title":"Lecture Notes in Computer Science","author":"Andreas Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M. (2009) Counting Paths and Packings in Halves. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757, pp 578\u2013586. Springer, Berlin, Heidelberg (2009)"},{"issue":"2","key":"1966_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2151171.2151181","volume":"8","author":"Andreas Bj\u00f6rklund","year":"2012","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. ACM Trans Algorithms 8(2) (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"1966_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of heider\u2019s theory. Psychol. Rev. 63, 277\u2013293 (1956)","journal-title":"Psychol. Rev."},{"issue":"2","key":"1966_CR8","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1016\/j.amc.2006.06.085","volume":"184","author":"GG Cash","year":"2007","unstructured":"Cash, G.G.: The number of n-cycles in a graph. Appl. Math. Comput. 184(2), 1080\u20131083 (2007)","journal-title":"Appl. Math. Comput."},{"key":"1966_CR9","first-page":"55","volume":"21","author":"F Harary","year":"1971","unstructured":"Harary, F., Manvel, B.: On the number of cycles in a graph. Matematick\u00fd \u010dasopis 21, 55\u201363 (1971)","journal-title":"Matematick\u00fd \u010dasopis"},{"issue":"2","key":"1966_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"RM Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49\u201351 (1982)","journal-title":"Oper. Res. Lett."},{"key":"1966_CR11","first-page":"385","volume":"24","author":"NP Khomenko","year":"1972","unstructured":"Khomenko, N.P., Golovko, L.D.: Identifying certain types of parts of a graph and computing their number. Ukrainskii Matematicheskii Zhurnal 24, 385\u2013396 (1972)","journal-title":"Ukrainskii Matematicheskii Zhurnal"},{"key":"1966_CR12","doi-asserted-by":"crossref","unstructured":"Madras, N., Slade, G.: The self-avoiding walk. Springer Science & Business Media (2013)","DOI":"10.1007\/978-1-4614-6025-1"},{"key":"1966_CR13","unstructured":"Perepechko, S.N., Voropaev, A.N.: The number of fixed length cycles in an undirected graph. explicit formulae in case of small lengths. In: Mathematical Modeling and Computational Physics (MMCP2009), pp. 148\u2013149 (2009)"},{"key":"1966_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02288782","volume":"17","author":"IC Ross","year":"1952","unstructured":"Ross, I.C., Harary, F.: On the determination of redundancies in sociometric chains. Psychometrika 17, 195\u2013208 (1952)","journal-title":"Psychometrika"},{"issue":"4","key":"1966_CR15","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.camwa.2011.06.026","volume":"62","author":"R Schott","year":"2011","unstructured":"Schott, R., Staples, G.S.: Complexity of counting cycles using zeons. Comput. Math. Appl. 62(4), 1828\u20131837 (2011)","journal-title":"Comput. Math. Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1966-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1966-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1966-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T17:04:50Z","timestamp":1662311090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1966-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1966"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1966-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"25 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}