{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:54:53Z","timestamp":1672340093676},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0166-218x(94)90023-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"219-223","source":"Crossref","is-referenced-by-count":6,"title":["The nonexistence of reduction rules giving an embedding into a k-tree"],"prefix":"10.1016","volume":"54","author":[{"given":"Jens","family":"Lagergren","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90023-X_BIB1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(94)90023-X_BIB2","series-title":"An algebraic theory of graph reduction","author":"Arnborg","year":"1990"},{"key":"10.1016\/0166-218X(94)90023-X_BIB3","first-page":"38","article-title":"Problems easy for tree-decomposable graph (extended abstract)","volume":"317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0166-218X(94)90023-X_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(94)90023-X_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 on graphs embedded in k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90023-X_BIB6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90023-X_BIB7","series-title":"MIT\u29f8LCS\u29f8TR-394","article-title":"Dynamic programming on graphs with bounded tree-width","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0166-218X(94)90023-X_BIB8","series-title":"RUU-CS-88-29","article-title":"Improved self-reduction algorithms for graphs with bounded tree-width","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0166-218X(94)90023-X_BIB9","series-title":"Graph Theory","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0166-218X(94)90023-X_BIB10","series-title":"Graph Theory and Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/0166-218X(94)90023-X_BIB11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second order logic of graphs I: Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0166-218X(94)90023-X_BIB12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01788098","article-title":"Characterization of partial 3-trees in terms of 3 structures","volume":"2","author":"Kajitani","year":"1986","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(94)90023-X_BIB13","first-page":"173","article-title":"Efficient parallel algorithms for tree-decomposition and related problems","author":"Lagergren","year":"1990","journal-title":"IEEE FoCS"},{"key":"10.1016\/0166-218X(94)90023-X_BIB14","author":"Matousek","year":"1989","journal-title":"Algorithms finding tree decompositions of graphs, manuscript"},{"key":"10.1016\/0166-218X(94)90023-X_BIB15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II. Algorithmic aspects of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90023-X_BIB16","author":"Robertson","year":"1986","journal-title":"Graph minors XIII. The disjoint path problem"},{"key":"10.1016\/0166-218X(94)90023-X_BIB17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On simple characterizations of k-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90023-X_BIB18","unstructured":"T.V. Wimer, Ph.D. Thesis, URI-030, Clemson University, Clemson."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9490023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9490023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:29:18Z","timestamp":1555122558000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9490023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X9490023X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90023-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}