乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:51:45Z","timestamp":1724449905404},"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)90026-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"251-266","source":"Crossref","is-referenced-by-count":96,"title":["k-NLC graphs and polynomial algorithms"],"prefix":"10.1016","volume":"54","author":[{"given":"Egon","family":"Wanke","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0166-218X(94)90026-4_BIB1","first-page":"227","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algorithms Discrete Methods"},{"key":"10.1016\/0166-218X(94)90026-4_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Problems easy for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90026-4_BIB3","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)90026-4_BIB4","first-page":"105","article-title":"Dynamic programming on graphs with bounded treewidth","volume":"317","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0166-218X(94)90026-4_BIB5","series-title":"Technical Report SM-DU-199","article-title":"Special graph classes \u2013 a survey","author":"Brandst\u00e4dt","year":"1991"},{"key":"10.1016\/0166-218X(94)90026-4_BIB6","first-page":"253","article-title":"Parity graphs","volume":"21","author":"Burlet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)90026-4_BIB7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)90026-4_BIB8","article-title":"Cographs: recognition, applications, and algorithms","author":"Corneil","year":"1984","journal-title":"Proceedings of 15th Southeastern Conference on Combinatories, Graph Theory, and Computing"},{"key":"10.1016\/0166-218X(94)90026-4_BIB9","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)90026-4_BIB10","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"643","author":"Habel","year":"1992"},{"key":"10.1016\/0166-218X(94)90026-4_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node label controlled graph languages","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0166-218X(94)90026-4_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","article-title":"Restrictions, extensions, and variations of NLC grammars","volume":"20","author":"Janssens","year":"1989","journal-title":"Inform. Sci."},{"key":"10.1016\/0166-218X(94)90026-4_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","article-title":"Graph grammars with neighbourhood-controlled embedding","volume":"21","author":"Janssens","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)90026-4_BIB14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On simple characterization of k-trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90026-4_BIB15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II. Algorithmic aspect of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90026-4_BIB16","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S1446788700029232","article-title":"Dacey graphs","volume":"18","author":"Sumner","year":"1974","journal-title":"J. Austral. Soc."},{"key":"10.1016\/0166-218X(94)90026-4_BIB17","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90026-4_BIB18","series-title":"Proceedings of the Annual ACM Symposium on Theory of Computing","first-page":"226","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","author":"Bodlaender","year":"1993"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900264?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:12Z","timestamp":1555136952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900264"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90026-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}