{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:52:14Z","timestamp":1660265534729},"reference-count":19,"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)90025-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"229-250","source":"Crossref","is-referenced-by-count":8,"title":["Regularity and locality in k-terminal graphs"],"prefix":"10.1016","volume":"54","author":[{"given":"Sanjeev","family":"Mahajan","sequence":"first","affiliation":[]},{"given":"Joseph G.","family":"Peters","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90025-6_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposibility\u2014a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0166-218X(94)90025-6_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)90025-6_BIB3","first-page":"38","article-title":"Problems easy for tree-decomposable graphs","volume":"317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0166-218X(94)90025-6_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)90025-6_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\/0166-218X(94)90025-6_BIB6_1","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)90025-6_BIB6_2","first-page":"117","article-title":"Preliminary version appeared as Why certain subgraph computations require only linear time","author":"Bern","year":"1985","journal-title":"Proceedings of the 26th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(94)90025-6_BIB7_1","first-page":"105","article-title":"Dynamic programming on graphs with bounded tree-width","volume":"317","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0166-218X(94)90025-6_BIB7_2","series-title":"Tech. Report RUU-CS-87-22","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0166-218X(94)90025-6_BIB8","series-title":"Automatic generation of linear algorithms from predicate calculus descriptions of problems of recursively constructed graph families","author":"Borie","year":"1988"},{"key":"10.1016\/0166-218X(94)90025-6_BIB9","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)90025-6_BIB10","author":"Hedetniemi","year":"1989","journal-title":"Bibliography of algorithms on partial k-trees"},{"key":"10.1016\/0166-218X(94)90025-6_BIB11","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0166-218X(94)90025-6_BIB12_1","first-page":"14","article-title":"Algorithms for regular properties in recursive graphs","author":"Mahajan","year":"1987","journal-title":"Proceedings of the 25th Allerton Conference on Communication, Control, and Computing"},{"key":"10.1016\/0166-218X(94)90025-6_BIB12_2","series-title":"Tech. Report TR 87-7","author":"Mahajan","year":"1987"},{"key":"10.1016\/0166-218X(94)90025-6_BIB13","first-page":"412","article-title":"Tree-partite graphs and the complexity of algorithms","volume":"199","author":"Seese","year":"1985"},{"key":"10.1016\/0166-218X(94)90025-6_BIB14","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series\u2013parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)90025-6_BIB15","series-title":"Ph.D. Thesis","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"},{"key":"10.1016\/0166-218X(94)90025-6_BIB16","first-page":"43","article-title":"A methodology for constructing linear graph algorithms","volume":"50","author":"Wimer","year":"1985","journal-title":"Congr. Numer."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:42Z","timestamp":1555131102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900256"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90025-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}