{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:53Z","timestamp":1759063433132},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024496","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"157-170","source":"Crossref","is-referenced-by-count":3,"title":["Parallel algorithms for treewidth two"],"prefix":"10.1007","author":[{"given":"Babette","family":"de Fluiter","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. R. Abrahamson","year":"1989","unstructured":"K. R. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. J. Algorithms, 10:287\u2013302, 1989.","journal-title":"J. Algorithms"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134\u20131164, 1993.","journal-title":"J. ACM"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S. Arnborg","year":"1986","unstructured":"S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3trees. SIAM J. Alg. Disc. Meth., 7:305\u2013314, 1986.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proceedings 14th International 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":"15_CR5","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305\u20131317, 1996.","journal-title":"SIAM J. Comput."},{"key":"15_CR6","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-61680-2_62","volume-title":"Proceedings 4st Annual European Symposium on Algorithms ESA'96","author":"H. L. Bodlaender","year":"1996","unstructured":"H. L. Bodlaender and B. de Fluiter. Parallel algorithms for series parallel graphs. In J. Diaz and M. Serna, editors, Proceedings 4st Annual European Symposium on Algorithms ESA'96, Lecture Notes on Computer Science, vol. 1136, pages 277\u2013289, Berlin, 1996. Springer Verlag."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender and B. de Fluiter. Reduction algorithms for constructing solutions in graphs with small treewidth. In J.-Y. Cai and C. K. Wong, editors, Proceedings 2nd Annual International Conference on Computing and Combinatorics, COCOON'96, pages 199\u2013208. Springer Verlag, Lecture Notes in Computer Science, vol. 1090, 1996.","DOI":"10.1007\/3-540-61332-3_153"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-60084-1_80","volume-title":"Proceedings 22nd International Colloquium on Automata, Languages and Programming","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. F\u00fcl\u00f6p and F. G\u00e9cseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268\u2013279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944. To appear in SIAM J. Computing, 1997."},{"key":"15_CR9","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":"15_CR10","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":"15_CR11","unstructured":"B. de Fluiter. Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University, 1997."},{"key":"15_CR12","series-title":"Technical Report UU-CS-1997-23","volume-title":"Parallel algorithms for graphs of treewidth two","author":"B. Fluiter de","year":"1997","unstructured":"B. de Fluiter and H. L. Bodlaender. Parallel algorithms for graphs of treewidth two. Technical Report UU-CS-1997-23, Dept. of Computer Science, Utrecht University, Utrecht, the Netherlands, 1997."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R. J. Duffin","year":"1965","unstructured":"R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303\u2013318, 1965.","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"15_CR14","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0404031","volume":"4","author":"D. Granot","year":"1991","unstructured":"D. Granot and D. Skorin-Kapov. NC algorithms for recognizing partial 2-trees and 3-trees. SIAM J. Disc. Meth., 4(3):342\u2013354, 1991.","journal-title":"SIAM J. Disc. Meth."},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/jagm.1996.0002","volume":"20","author":"J. Lagergren","year":"1996","unstructured":"J. Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms, 20:20\u201344, 1996.","journal-title":"J. Algorithms"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matou\u0161ek","year":"1991","unstructured":"J. Matou\u0161ek and R. Thomas. Algorithms finding tree-decompositions of graphs. J. Algorithms, 12:1\u201322, 1991.","journal-title":"J. Algorithms"},{"key":"15_CR17","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 treewidth. J. Algorithms, 7:309\u2013322, 1986.","journal-title":"J. Algorithms"},{"issue":"1","key":"15_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S0895480193243043","volume":"9","author":"D. P. Sanders","year":"1996","unstructured":"D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Meth., 9(1):101\u2013117, 1996.","journal-title":"SIAM J. Disc. Meth."}],"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\/BFb0024496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:19Z","timestamp":1586568919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024496","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}