乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T16:13:16Z","timestamp":1686586396253},"reference-count":37,"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)90018-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"101-115","source":"Crossref","is-referenced-by-count":15,"title":["Improved self-reduction algorithms for graphs with bounded treewidth"],"prefix":"10.1016","volume":"54","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90018-3_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2013 a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0166-218X(94)90018-3_BIB2","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)90018-3_BIB3","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reduction","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90018-3_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"},{"key":"10.1016\/0166-218X(94)90018-3_BIB5","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)90018-3_BIB6","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\/0166-218X(94)90018-3_BIB7","series-title":"Technical Report","article-title":"Dynamic programming algorithms on graphs with bounded tree-width","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0166-218X(94)90018-3_BIB8","first-page":"1","article-title":"NC-algorithms for graphs with small treewidth","volume":"vol. 344","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0166-218X(94)90018-3_BIB9","first-page":"116","article-title":"Some classes of graphs with bounded treewidth","volume":"36","author":"Bodlaender","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/0166-218X(94)90018-3_BIB10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursive constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(94)90018-3_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207168908803783","article-title":"Nonconstructive polynomial-time decidability and self-reducibility","volume":"31","author":"Brown","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0166-218X(94)90018-3_BIB12","first-page":"257","article-title":"The monadic second-order logic of graphs III: treewidth, forbidden minors and complexity issues","volume":"26","author":"Courcelle","year":"1992","journal-title":"Informatique Th\u00e9orique"},{"key":"10.1016\/0166-218X(94)90018-3_BIB13","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)90018-3_BIB14_1","author":"Fellows","year":"1990","journal-title":"Cutset regularity beats well-quasi-ordering for bounded treewidth"},{"key":"10.1016\/0166-218X(94)90018-3_BIB14_2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1090\/conm\/147\/01199","article-title":"Finite automata, bounded treewidth and well-quasiordering","volume":"147","author":"Fellows","year":"1993","journal-title":"Contemp. Math."},{"key":"10.1016\/0166-218X(94)90018-3_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)90018-3_BIB16","first-page":"278","article-title":"Fast self-reduction algorithms for combinatorial problems of VLSI design","volume":"vol. 319","author":"Fellows","year":"1988"},{"key":"10.1016\/0166-218X(94)90018-3_BIB17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0405010","article-title":"On well-partial-order theory and its application to combinatorial problems of VLSI design","volume":"5","author":"Fellows","year":"1992","journal-title":"SIAM J. Discrete Methods"},{"key":"10.1016\/0166-218X(94)90018-3_BIB18","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90018-3_BIB19","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/SFCS.1989.63528","article-title":"An analogue of the Myhill-Nerode of the theorem and its use in computing finite-basis characterizations","author":"Fellows","year":"1989","journal-title":"Proceedings 29th Annual Symposium on Foundations of Computing Science (FOCS)"},{"key":"10.1016\/0166-218X(94)90018-3_BIB20","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989","journal-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"10.1016\/0166-218X(94)90018-3_BIB21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"Searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)90018-3_BIB22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/FSCS.1990.89536","article-title":"Efficient parallel algorithms for tree-decomposition and related problems","author":"Lagergren","year":"1990","journal-title":"Proceedings 30th Annual Symposium on Foundations of Computing Science (FOCS)"},{"key":"10.1016\/0166-218X(94)90018-3_BIB23","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","article-title":"Recontamination does not help to search a graph","volume":"40","author":"LaPaugh","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90018-3_BIB24","first-page":"362","article-title":"Efficient algorithms on context-free graph languages","volume":"vol. 317","author":"Lautemann","year":"1988"},{"key":"10.1016\/0166-218X(94)90018-3_BIB25","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","article-title":"Black-white pebbles and graph separation","volume":"16","author":"Lengauer","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(94)90018-3_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","article-title":"Algorithms finding tree-decompositions of graphs","volume":"12","author":"Matous\u011bk","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90018-3_BIB27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","article-title":"The complexity of searching of graph","volume":"35","author":"Megiddo","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90018-3_BIB28","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","article-title":"Min cut is NP-complete for edge weighted trees","volume":"58","author":"Monien","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)90018-3_BIB29","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0095-8956(86)90031-6","article-title":"Graph minors IV: tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90018-3_BIB30","unstructured":"N. Robertson and P.D. Seymour, Graph minors XVI: Wagner's conjecture, to appear."},{"key":"10.1016\/0166-218X(94)90018-3_BIB31","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors III: planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90018-3_BIB32","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)90018-3_BIB33","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors X: obstructions to tree-decompositions","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90018-3_BIB34","author":"Robertson","year":"1986","journal-title":"Graph minors XIII: the disjoint paths problem"},{"key":"10.1016\/0166-218X(94)90018-3_BIB35","series-title":"Report R-MATH-03\/87","article-title":"Linear-time algorithms for NP-complete problems restricted to partial k-trees","author":"Scheffler","year":"1987"},{"key":"10.1016\/0166-218X(94)90018-3_BIB36","first-page":"226","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","author":"Bodlaender","year":"1993","journal-title":"Proceedings 25th STOC"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900183?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:27Z","timestamp":1555136967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900183"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90018-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}