{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:27Z","timestamp":1759638987004},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0012-365x(98)00113-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"39-54","source":"Crossref","is-referenced-by-count":37,"title":["An algorithm for the Tutte polynomials of graphs of bounded treewidth"],"prefix":"10.1016","volume":"190","author":[{"given":"Artur","family":"Andrzejak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00113-7_bib1","series-title":"Combinatorial Theory","author":"Aigner","year":"1979"},{"key":"10.1016\/S0012-365X(98)00113-7_bib2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.1997.1767","article-title":"Splitting formulas for Tutte polynomials","volume":"70","author":"Andrzejak","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00113-7_bib3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"issue":"2","key":"10.1016\/S0012-365X(98)00113-7_bib4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0012-365X(98)00113-7_bib5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00113-7_bib6","first-page":"1","article-title":"NC-Algorithms for graphs with small treewidth","volume":"344","author":"Bodlaender","year":"1989"},{"key":"10.1016\/S0012-365X(98)00113-7_bib7","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10.1016\/S0012-365X(98)00113-7_bib8","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0012-365X(98)00113-7_bib9","first-page":"268","article-title":"Parallel algorithms with optimal speedup for bounded treewidth","volume":"944","author":"Bodlaender","year":"1995"},{"key":"10.1016\/S0012-365X(98)00113-7_bib10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0012-365X(98)00113-7_bib11","series-title":"Matroid applications","first-page":"123","article-title":"The Tutte polynomial and its applications","volume":"vol. 40","author":"Brylawski","year":"1992"},{"key":"10.1016\/S0012-365X(98)00113-7_bib12","article-title":"The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions","volume":"3","author":"Gessel","year":"1996"},{"key":"10.1016\/S0012-365X(98)00113-7_bib13","first-page":"35","article-title":"On the computational complexity of the Jones and Tutte polynomials","volume":"108","author":"Jaeger","year":"1990"},{"key":"10.1016\/S0012-365X(98)00113-7_bib14","series-title":"Handbook of Theoretical Computer Science","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0012-365X(98)00113-7_bib15","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1090\/S0002-9947-1987-0869224-1","article-title":"Polynomial Invariants of Graphs","volume":"299","author":"Negami","year":"1987","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0012-365X(98)00113-7_bib16","unstructured":"S. Noble, Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width, private communication."},{"issue":"1\u20133","key":"10.1016\/S0012-365X(98)00113-7_bib17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0012-365X(92)90289-R","article-title":"Tutte polynomials computable in polynomial time","volume":"109","author":"Oxley","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00113-7_bib18","unstructured":"V.L. Vertigan, The computational complexity of Tutte invariants for planar graphs, to appear."},{"key":"10.1016\/S0012-365X(98)00113-7_bib19","article-title":"Complexity: Knots, colourings and counting","volume":"vol. 186","author":"Welsh","year":"1993"},{"issue":"1\u20133","key":"10.1016\/S0012-365X(98)00113-7_bib20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0012-365X(92)00065-Y","article-title":"The computational complexity of knot and matroid polynomials","volume":"124","author":"Welsh","year":"1994","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:54:03Z","timestamp":1556117643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0012365X98001137"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00113-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}