{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:30Z","timestamp":1725552150338},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_6","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"59-68","source":"Crossref","is-referenced-by-count":6,"title":["Computing the Tutte Polynomial on Graphs of Bounded Clique-Width"],"prefix":"10.1007","author":[{"given":"Omer","family":"Gim\u00e9nez","sequence":"first","affiliation":[]},{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Noy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650","volume-title":"The theory of partitions","author":"G.E. Andrews","year":"1984","unstructured":"Andrews, G.E.: The theory of partitions. Cambridge U. Press, Cambridge (1984)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0012-365X(98)00113-7","volume":"190","author":"A. Andrzejak","year":"1998","unstructured":"Andrzejak, A.: An Algorithm for the Tutte Polynomials of Graphs of Bounded Treewidth. Discrete Math.\u00a0190, 39\u201354 (1998)","journal-title":"Discrete Math."},{"key":"6_CR3","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 Comput. Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Systems"},{"key":"6_CR4","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 Appl. Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Gim\u00e9nez, O., Noy, M.: On the complexity of computing the Tutte polynomial of bicircular matroids. Combin. Probab. Computing (to appear)","DOI":"10.1017\/S0963548305007327"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gim\u00e9nez, O., Hlin\u011bn\u00fd, P., Noy, M.: Computing the Tutte Polynomial on graphs of Bounded Clique-Width (2005) (manuscript)","DOI":"10.1007\/11604686_6"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P.: The Tutte Polynomial for Matroids of Bounded Branch-Width, Combin. Probab. Computing (2005) (to appear)","DOI":"10.1017\/S0963548305007297"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the Computational Complexity of the Jones and Tutte Polynomials. Math. Proc. Camb. Phil. Soc.\u00a0108, 35\u201353 (1990)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Math.\u00a0126, 197\u2013221 (2003)","journal-title":"Discrete Applied Math."},{"key":"6_CR10","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1017\/S0963548398003551","volume":"7","author":"S.D. Noble","year":"1998","unstructured":"Noble, S.D.: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. Combin. Probab. Computing\u00a07, 307\u2013321 (1998)","journal-title":"Combin. Probab. Computing"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.5802\/aif.1706","volume":"49","author":"S.D. Noble","year":"1999","unstructured":"Noble, S.D., Welsh, D.J.A.: A weighted graph polynomial from chromatic invariants of knots. Ann. Inst. Fourier (Grenoble)\u00a049, 1057\u20131087 (1999)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"6_CR13","unstructured":"Oum, S.-I., Seymour, P.D.: Approximating Clique-width and Branch-width (2004) (submitted)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11604686_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.-I. Oum","year":"2005","unstructured":"Oum, S.-I.: Approximating Rank-width and Clique-width Quickly. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 49\u201358. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:31Z","timestamp":1619507071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11604686_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}