{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:35:43Z","timestamp":1743096943318,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319921976"},{"type":"electronic","value":"9783319921983"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-92198-3_8","type":"book-chapter","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T04:29:32Z","timestamp":1527136172000},"page":"72-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas"],"prefix":"10.1007","author":[{"given":"Marco A.","family":"L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"De Ita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yolanda","family":"Moyao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,25]]},"reference":[{"issue":"2","key":"8_CR1","first-page":"250","volume":"15","author":"G Ita De","year":"2007","unstructured":"De Ita, G., Bello, P., Contreras, P.: New polynomial classes for #2SAT established via graph-topological structure. Eng. Lett. 15(2), 250\u2013258 (2007)","journal-title":"Eng. Lett."},{"issue":"1\u20132","key":"8_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractability of counting theory models and its application to belief revision and truth maintenance. J. Appl. Non-classical Logics 11(1\u20132), 11\u201334 (2001)","journal-title":"J. Appl. Non-classical Logics"},{"issue":"1\u20132","key":"8_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(1\u20132), 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-30498-2_43","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2004","author":"G Ita Luna","year":"2004","unstructured":"Ita Luna, G.: Polynomial classes of Boolean formulas for computing the degree of belief. In: Lema\u00eetre, C., Reyes, C.A., Gonz\u00e1lez, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 430\u2013440. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30498-2_43"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-79723-4_19","volume-title":"Parameterized and Exact Computation","author":"M Wahlstr\u00f6m","year":"2008","unstructured":"Wahlstr\u00f6m, M.: A tighter bound for counting max-weight solutions to 2SAT instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202\u2013213. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_19"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/11499107_31","volume-title":"Theory and Applications of Satisfiability Testing","author":"E Dantsin","year":"2005","unstructured":"Dantsin, E., Wolpert, A.: An improved upper bound for SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 400\u2013407. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_31"},{"key":"8_CR7","unstructured":"L\u00f3pez, M.A., Marcial-Romero, J.R., De Ita Luna, G., Montes Venegas, H.A., Alejo, R.: A linear time algorithm for solving #2SAT on cactus formulas. CoRR, abs\/1702.08581 (2017)"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Zmazek, B., Zerovnik, J.: Estimating the traffic on weighted cactus networks in linear time. In: Ninth International Conference on Information Visualisation (IV 2005), pp. 536\u2013541 (2005). https:\/\/doi.org\/10.1109\/IV.2005.48","DOI":"10.1109\/IV.2005.48"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"2978","DOI":"10.1016\/j.dam.2008.01.008","volume":"156","author":"WC Shiu","year":"2008","unstructured":"Shiu, W.C.: Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders. Discret. Appl. Math. 156, 2978\u20132985 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"8_CR10","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 Appl. Math. 112(3), 323\u2013346 (2010)","journal-title":"Acta Appl. Math."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188\u2013202. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_15"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"Supplement C","key":"8_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.entcs.2009.08.028","volume":"251","author":"J Kneis","year":"2009","unstructured":"Kneis, J., Langer, A.: A practical approach to Courcelle\u2019s theorem. Electron. Not. Theor. Comput. Sci. 251(Supplement C), 65\u201381 (2009). Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008)","journal-title":"Electron. Not. Theor. Comput. Sci."},{"issue":"2","key":"8_CR14","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(2), 181\u2013207 (2009)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"A Stefan","year":"1987","unstructured":"Stefan, A., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discret. Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"8_CR16","unstructured":"Bodlaender, H.L.: Classes of graphs with bounded tree-width. Technical report, Utrecht University (1986)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR18","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."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92198-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T08:14:14Z","timestamp":1571386454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92198-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319921976","9783319921983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92198-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}