{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T21:50:32Z","timestamp":1785016232660,"version":"3.55.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0020-0190(95)00190-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:09:59Z","timestamp":1027613399000},"page":"197-203","source":"Crossref","is-referenced-by-count":16,"title":["A simple linear-time algorithm for finding path-decompositions of small width"],"prefix":"10.1016","volume":"57","author":[{"given":"Kevin","family":"Cattell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael J.","family":"Dinneen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00190-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 \u2014 A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0020-0190(95)00190-5_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(95)00190-5_BIB3","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","article-title":"Quickly excluding a forest","volume":"52","author":"Bienstock","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(95)00190-5_BIB4","series-title":"Proc. 15th Internat. Coll. on Automata, Languages and Programming","first-page":"105","article-title":"Dynamic programming algorithms on graphs with bounded tree-width","volume":"317","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0020-0190(95)00190-5_BIB5","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\/0020-0190(95)00190-5_BIB6","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/0020-0190(95)00190-5_BIB7","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"226","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","author":"Bodlaender","year":"1993"},{"key":"10.1016\/0020-0190(95)00190-5_BIB8","series-title":"Proc. 18th Internat. Coll. on Automata, Languages and Programming","first-page":"544","article-title":"Better algorithms for the pathwidth and treewidth of graphs","volume":"510","author":"Bodlaender","year":"1991"},{"key":"10.1016\/0020-0190(95)00190-5_BIB9","series-title":"Orders, Algorithms and Applications, ORDAL'94","first-page":"86","article-title":"A characterization of graphs with vertex cover up to five","volume":"831","author":"Cattell","year":"1994"},{"key":"10.1016\/0020-0190(95)00190-5_BIB10","series-title":"Proc. 4th Workshop on Algorithms and Data Structures, WADS'95","article-title":"Obstructions to within a few vertices or edges of acyclic","author":"Cattell","year":"1995"},{"key":"10.1016\/0020-0190(95)00190-5_BIB11","series-title":"Computational aspects of the graph minor theorem: Obstructions for unions and intertwines","author":"Cattell","year":"1995"},{"key":"10.1016\/0020-0190(95)00190-5_BIB12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluations on tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00190-5_BIB13","article-title":"Bounded combinatorial width and forbidden substructures","author":"Dinneen","year":"1995"},{"key":"10.1016\/0020-0190(95)00190-5_BIB14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","article-title":"The vertex separation and the search number of a graph","volume":"113","author":"Ellis","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(95)00190-5_BIB15","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 Math."},{"key":"10.1016\/0020-0190(95)00190-5_BIB16","article-title":"Treewidth","author":"Kloks","year":"1993"},{"key":"10.1016\/0020-0190(95)00190-5_BIB17","series-title":"Proc. 31st Symp. on Foundations of Computer Science","first-page":"173","article-title":"Efficient parallel algorithms for tree-decomposition and related problems","author":"Lagergren","year":"1990"},{"key":"10.1016\/0020-0190(95)00190-5_BIB18","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","volume":"7","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/0020-0190(95)00190-5_BIB19","series-title":"Proc. 24th Ann. Symp. on Theory of Computing","first-page":"221","article-title":"Finding approximate separators and computing tree-width quickly","author":"Reed","year":"1992"},{"key":"10.1016\/0020-0190(95)00190-5_BIB20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph Minors. I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(95)00190-5_BIB21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II: Algorithmic aspects of treewidth","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(95)00190-5_BIB22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors X: Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(95)00190-5_BIB23","series-title":"Graph minors XIII: The disjoint paths problem","author":"Robertson","year":"1986"},{"key":"10.1016\/0020-0190(95)00190-5_BIB24","unstructured":"N. Robertson and P.D. Seymour, Graph minors XVI: Wagner's conjecture, to appear."},{"key":"10.1016\/0020-0190(95)00190-5_BIB25","first-page":"43","article-title":"A methodology for constructing linear graph algorithms","volume":"50","author":"Wimer","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001905?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001905?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:26:39Z","timestamp":1556274399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0020019095001905"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00190-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}