{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:33Z","timestamp":1725664053646},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:41:05Z","timestamp":1330263665000},"page":"45-56","source":"Crossref","is-referenced-by-count":3,"title":["On reduction algorithms for graphs with small treewidth"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and wellquasiordering. In Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539\u2013564. American Mathematical Society, 1993.","DOI":"10.1090\/conm\/147\/01199"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. In H. Ehrig, H. Kreowski, and G. Rozenberg, editors, Proceedings of the Fourth Workshop on Graph Grammars and Their Applications to Computer Science, pages 70\u201383. Springer Verlag, Lecture Notes in Computer Science, vol. 532, 1991. To appear in J. ACM.","DOI":"10.1007\/BFb0017382"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308\u2013340, 1991.","journal-title":"J. Algorithms"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proc. Workshop on Graph-Theoretic Concepts in Computer Science WG'88, pages 1\u201310. Springer Verlag, Lecture Notes in Computer Science, vol. 344, 1988.","DOI":"10.1007\/3-540-50728-0_32"},{"key":"5_CR5","volume-title":"Technical Report RUU-CS-92-12","author":"H. L. Bodlaender","year":"1992","unstructured":"H. L. Bodlaender. A tourist guide through treewidth. Technical Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, 1992. To appear in Acta Cybernetica."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 226\u2013234. ACM Press, 1993.","DOI":"10.1145\/167088.167161"},{"key":"5_CR7","first-page":"192","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. Graph-rewriting: an algebraic and logical approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 192\u2013242, Amsterdam, 1990. North Holland Publ. Comp."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"B. Reed. Finding approximate separators and computing tree-width quickly. In Proceedings of the 24th Annual Symposium on Theory of Computing, pages 221\u2013228, 1992.","DOI":"10.1145\/129712.129734"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309\u2013322, 1986.","journal-title":"J. Algorithms"}],"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-57899-4_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:42Z","timestamp":1605647742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}