{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T13:25:55Z","timestamp":1745587555551},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:39:42Z","timestamp":1330245582000},"page":"112-124","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic algorithms for graphs with treewidth 2"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539\u2013564. American Mathematical Society, 1993.","DOI":"10.1090\/conm\/147\/01199"},{"key":"10_CR2","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":"10_CR3","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":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/jagm.1993.1035","volume":"15","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender and T. Kloks. A simple linear time algorithm for triangulating threecolored graphs. J. Algorithms, 15:160\u2013172, 1993.","journal-title":"J. Algorithms"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R. B. Borie","year":"1992","unstructured":"R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555\u2013582, 1992.","journal-title":"Algorithmica"},{"key":"10_CR7","unstructured":"N. Chandrasekharan. Fast Parallel Algorithms and Enumeration Techniques for Partial k-Trees. PhD thesis, Clemson University, 1990."},{"key":"10_CR8","unstructured":"R. F. Cohen, S. Sairam, R. Tamassia, and J. S. Vitter. Dynamic algorithms for bounded tree-width graphs. Technical Report CS-92-19, Department of Computer Science, Brown University, 1992."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"D. Fern\u00e1ndez-Baca and G. Slutzki. Parametic problems on graphs of bounded treewidth. In O. Nurmi and E. Ukkonen, editors, Proceedings 3rd Scandinavian Workshop on Algorithm Theory, pages 304\u2013316. Springer Verlag, Lecture Notes in Computer Science, vol. 621, 1992.","DOI":"10.1007\/3-540-55706-7_26"},{"key":"10_CR10","unstructured":"G. N. Frederickson. A data structure for dynamically maintaining rooted trees. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 175\u2013184, 1993."},{"key":"10_CR11","unstructured":"G. N. Frederickson. Maintaining regular properties dynamically in k-terminal graphs. Manuscript, 1993."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J. Lagergren. Efficient parallel algorithms for tree-decomposition and related problems. In Proceedings of the 31rd Annual Symposium on Foundations of Computer Science, pages 173\u2013182, 1990.","DOI":"10.1109\/FSCS.1990.89536"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matous\u011bk","year":"1991","unstructured":"J. Matous\u011bk and R. Thomas. Algorithms finding tree-decompositions of graphs. J. Algorithms, 12:1\u201322, 1991.","journal-title":"J. Algorithms"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. Reif. Parallel tree contraction and its application. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"10_CR15","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":"10_CR16","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"},{"key":"10_CR17","first-page":"527","volume-title":"Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory","author":"J. Leeuwen van","year":"1990","unstructured":"J. van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, pages 527\u2013631, Amsterdam, 1990. North Holland Publ. Comp."}],"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_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:44Z","timestamp":1605629744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}