{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:59Z","timestamp":1773762659781,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0196-6774(90)90013-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"631-643","source":"Crossref","is-referenced-by-count":148,"title":["Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees"],"prefix":"10.1016","volume":"11","author":[{"given":"Hans L","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90013-5_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability\u2014A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0196-6774(90)90013-5_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\/0196-6774(90)90013-5_BIB3","first-page":"38","article-title":"Problems easy for tree-decomposable graphs (extended abstract)","volume":"Vol. 317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_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\/0196-6774(90)90013-5_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\/0196-6774(90)90013-5_BIB6","article-title":"Classes of graphs with Bounded Treewidth","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0196-6774(90)90013-5_BIB7","series-title":"Tech. report, Lab. for Comput. Science","article-title":"Dynamic Programming Algorithms on Graphs with Bounded Treewidth","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0196-6774(90)90013-5_BIB8","article-title":"Improved Self-reduction Algorithms for Graphs with Bounded Treewidth","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_BIB9","first-page":"1","article-title":"NC-algorithms for graphs with small treewidth","volume":"Vol. 344","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_BIB10","series-title":"Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursive constructed graph families","author":"Borie","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_BIB11","series-title":"Proceedings 26th Annual Allerton Conference on Communication, Control, and Computing","article-title":"Fast parallel algorithms for tree decomposition and parsing partial k-trees","author":"Chanrasekharan","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_BIB12","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\/0196-6774(90)90013-5_BIB13","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90013-5_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90013-5_BIB15","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90013-5_BIB16","series-title":"On the complexity of finding iso- and other morphisms for partial k-trees","author":"Matous\u011bk","year":"1988"},{"key":"10.1016\/0196-6774(90)90013-5_BIB17","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\/0196-6774(90)90013-5_BIB18","series-title":"Graph minors. XII. Excluding a non-planar graph","author":"Robertson","year":"1986"},{"key":"10.1016\/0196-6774(90)90013-5_BIB19","article-title":"Linear-Time Algorithms for NP-Complete Problems Restricted to Partial k-Trees","author":"Scheffler","year":"1987"},{"key":"10.1016\/0196-6774(90)90013-5_BIB20","article-title":"Die Baumweite von Graphen als ein Ma\u00df f\u00fcr die Kompliziertheit algorithmischer Probleme","author":"Scheffler","year":"1989"},{"key":"10.1016\/0196-6774(90)90013-5_BIB21","series-title":"Proceedings WG'83 International Workshop on Graph Theoretic Concepts in Computer Science","first-page":"342","article-title":"NP-complete problems on some tree-structured graphs: A review","author":"Sys\u0142o","year":"1983"},{"key":"10.1016\/0196-6774(90)90013-5_BIB22","series-title":"Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory","article-title":"Graph algorithms","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/0196-6774(90)90013-5_BIB23","article-title":"Linear Algorithms on k-Terminal Graphs","author":"Wimer","year":"1987"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900135?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900135?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:53:57Z","timestamp":1548726837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677490900135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0196677490900135"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90013-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}