{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:34Z","timestamp":1725582274196},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_47","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T06:35:17Z","timestamp":1303886117000},"page":"483-494","source":"Crossref","is-referenced-by-count":0,"title":["Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width"],"prefix":"10.1007","author":[{"given":"Benjamin Hellouin","family":"de Menibus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.J. Bandelt","year":"1986","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-hereditary Graphs. Journal of Combinatorial Theory, Series B\u00a041(2), 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/10719839_14","volume-title":"LATIN 2000: Theoretical Informatics","author":"D.G. Corneil","year":"2000","unstructured":"Corneil, D.G., Habib, M., Lanlignel, J.-M., Reed, B., Rotics, U.: Polynomial Time Recognition of Clique-Width \u2264 3 Graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 126\u2013134. Springer, Heidelberg (2000)"},{"issue":"4","key":"47_CR4","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the Relationship Between Clique-Width and Treewidth. SIAM Journal of Computing\u00a034(4), 825\u2013847 (2005)","journal-title":"SIAM Journal of Computing"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-Rewriting Hypergraph Grammars. J.\u00a0Comput.\u00a0Syst.\u00a0Sciences\u00a046, 218\u2013270 (1993)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sciences"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. Theory of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper Bounds to the Clique-Width of Graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P. Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the Permanent of Graphs with Large Factors. Theoretical Computer Science\u00a0102, 283\u2013305 (1992)","journal-title":"Theoretical Computer Science"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique width Minimization is NP-hard. Proceedings of the 38th annual ACM Symposium on Theory of Computing, session 8B, pp.\u00a0354\u2013362 (2006)","DOI":"10.1145\/1132516.1132568"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic Lower Bounds for Problems Parameterized by Clique-Width. In: Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 493\u2013502. ACM and SIAM (2010)","DOI":"10.1137\/1.9781611973075.42"},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11604686_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"O. Gim\u00e9nez","year":"2005","unstructured":"Gim\u00e9nez, O., Hlin\u011bn\u00fd, P., Noy, M.: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 59\u201368. Springer, Heidelberg (2005)"},{"issue":"3","key":"47_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science\u00a011(3), 423\u2013443 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1063\/1.1703953","volume":"4","author":"P.W. Kasteleyn","year":"1963","unstructured":"Kasteleyn, P.W.: Dimer Statistics and Phase Transitions. Journal of Mathematical Physics\u00a04, 287\u2013293 (1963)","journal-title":"Journal of Mathematical Physics"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11917496_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.A. Makowsky","year":"2006","unstructured":"Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing Graph Polynomials on Graphs of Bounded Clique-Width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 191\u2013204. Springer, Heidelberg (2006)"},{"issue":"2","key":"47_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y. Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the Independent Sets in a Chordal Graph. Journal of Discrete Algorithms\u00a06(2), 229\u2013242 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-11409-0_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y. Okamoto","year":"2010","unstructured":"Okamoto, Y., Uehara, R., Uno, T.: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol.\u00a05911, pp. 296\u2013307. Springer, Heidelberg (2010)"},{"issue":"4","key":"47_CR17","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating Clique-Width and Branch-Width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"47_CR18","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing\u00a031, 398\u2013427 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Computing the Permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"47_CR20","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:23:33Z","timestamp":1558589013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}