{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:49:54Z","timestamp":1743065394782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319393926"},{"type":"electronic","value":"9783319393933"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-39393-3_17","type":"book-chapter","created":{"date-parts":[[2016,5,20]],"date-time":"2016-05-20T15:24:36Z","timestamp":1463757876000},"page":"167-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Counting of the Number of Independent Sets on Polygonal Trees"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"De Ita","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Bello","sequence":"additional","affiliation":[]},{"given":"Meliza","family":"Contreras","sequence":"additional","affiliation":[]},{"given":"Juan C.","family":"Catana-Salazar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,21]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.disc.2009.11.026","volume":"310","author":"T Do\u0161li\u0107","year":"2010","unstructured":"Do\u0161li\u0107, T., M\u00e5l\u00f8y, F.: Chain hexagonal cacti: matchings and independent sets. Discrete Math. 310, 1676\u20131690 (2010)","journal-title":"Discrete Math."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/11604686_38","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y Okamoto","year":"2005","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Linear-time counting algorithms for independent sets in chordal graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 433\u2013444. Springer, Heidelberg (2005)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82, 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10440-010-9575-5","volume":"112","author":"S Wagner","year":"2010","unstructured":"Wagner, S., Gutman, I.: Maxima and minima of the Hosoya index and the Merrifield-Simmons index. Acta Applicandae Math. 112(3), 323\u2013346 (2010)","journal-title":"Acta Applicandae Math."},{"key":"17_CR5","first-page":"471","volume":"64","author":"H Deng","year":"2010","unstructured":"Deng, H.: Catacondensed benzenoids and phenylenes with the extremal third-order Randic Index. Comm. Math. Comp. Chem. 64, 471\u2013496 (2010)","journal-title":"Comm. Math. Comp. Chem."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1613\/jair.4391","volume":"51","author":"C B\u00e4ckstr\u00f6m","year":"2014","unstructured":"B\u00e4ckstr\u00f6m, C., Jonsson, A., Jonsson, P.: Automaton plans. J. Artif. Intell. Res. 51, 255\u2013291 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-007-9133-3","volume":"54","author":"FV Fomin","year":"2009","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Algorithmica 54, 181\u2013207 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR8","first-page":"16","volume":"20","author":"H Prodinger","year":"1982","unstructured":"Prodinger, H., Tichy, R.F.: Fibonacci numbers of graphs. Fibonacci Q. 20(1), 16\u201321 (1982)","journal-title":"Fibonacci Q."},{"issue":"02","key":"17_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y Zhao","year":"2010","unstructured":"Zhao, Y.: The number of independent sets in a regular graph. Comb. Probab. Comput. 19(02), 315\u2013320 (2010)","journal-title":"Comb. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39393-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:04:27Z","timestamp":1589933067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39393-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319393926","9783319393933"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39393-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}