{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:47:44Z","timestamp":1725482864994},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_15","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"148-154","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Algorithm for Finding Tree Decompositions of Small Width"],"prefix":"10.1007","author":[{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. of Algorithms 12 (1991) 308\u2013340","journal-title":"J. of Algorithms"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. Assoc. Comput. Mach. 40 (1993) 1134\u20131164","journal-title":"J. Assoc. Comput. Mach."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D. G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebra Discrete Methods 8 (1987) 277\u2013284 149","journal-title":"SIAM J. Algebra Discrete Methods"},{"issue":"6","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"Bodlaender, H. L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:6 (1996) 1305\u20131317 149, 150, 154","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. L. Bodlaender","year":"1998","unstructured":"Bodlaender, H. L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209:1-2 (1998) 1\u201345 148","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H. L. Bodlaender","year":"1996","unstructured":"Bodlaender, H. L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21:2 (1996) 358\u2013402 151","journal-title":"J. Algorithms"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.1996.0002","volume":"20","author":"J. Lagergren","year":"1996","unstructured":"Lagergren, J.: Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms 20 (1996) 20\u201344 149","journal-title":"J. Algorithms"},{"key":"15_CR8","unstructured":"Reed, B.: Finding approximate separators and computing treewidth quickly. Proc. 24th STOC (1992) 221\u2013228 149"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Reed, B.: Manuscript (1992) 149","DOI":"10.1007\/978-1-4684-6521-1_4"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour P. D.: Graph Minors II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309\u2013322 148, 149","journal-title":"J. Algorithms"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0095-8956(86)90031-6","volume":"45","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour P. D.: Graph Minors VI. Disjoint paths across a disk. J. Combin. Theory Ser. B 45 (1986) 115\u2013138 149","journal-title":"J. Combin. Theory Ser. B"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors XIII. The disjoint path problem. J. Combin. Theory Ser. B 63 (1995) 65\u2013110 149","journal-title":"J. Combin. Theory Ser. B"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour P. D.: Graph Minors VII. Disjoint paths on a surface. J. Combin. Theory Ser. B ?? (1988) 212\u2013254 149","DOI":"10.1016\/0095-8956(88)90070-6"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:06Z","timestamp":1556321886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}