{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:49Z","timestamp":1725551089212},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_16","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:05Z","timestamp":1269882725000},"page":"176-185","source":"Crossref","is-referenced-by-count":7,"title":["Safe Reduction Rules for Weighted Treewidth"],"prefix":"10.1007","author":[{"given":"Frank","family":"van den Eijkhof","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277\u2013284, 1987.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"16_CR2","doi-asserted-by":"publisher","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 3-trees. SIAM J. Alg. Disc. Meth., 7:305\u2013314, 1986.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math., 23:11\u201324, 1989.","journal-title":"Disc. Appl. Math."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. L. Bodlaender","year":"1998","unstructured":"H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1\u201345, 1998.","journal-title":"Theor. Comp. Sc."},{"key":"16_CR5","unstructured":"H. L. Bodlaender, A. M. C. A. Koster, F. van den Eijkhof, and L. C. van der Gaag. Pre-processing for triangulation of probabilistic networks. In J. Breese and D. Koller, editors, Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pages 32\u201339, San Francisco, 2001. Morgan Kaufmann."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender and R. H. M\u00f6hring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181\u2013188, 1993.","journal-title":"SIAM J. Disc. Math."},{"key":"16_CR7","volume-title":"Statistics for Engineering and Information Science","author":"F. V. Jensen","year":"2001","unstructured":"F. V. Jensen. Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science, Springer-Verlag, New York, 2001."},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth. Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"T. Kloks. Treewidth. Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer-Verlag, Berlin, 1994."},{"key":"16_CR9","unstructured":"A. M. C. A. Koster, S. P. M. van Hoesel, and A. W. J. Kolen. Solving frequency assignment problems via tree-decomposition. Technical Report RM\/99\/011, Faculty of Economics and Business Administration, Universiteit Maastricht, Maastricht, the Netherlands, 1999."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)90023-X","volume":"54","author":"J. Lagergren","year":"1994","unstructured":"J. Lagergren. The nonexistence of reduction rules giving an embedding into a k-tree. Disc. Appl. Math., 54:219\u2013223, 1994.","journal-title":"Disc. Appl. Math."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. J. Lauritzen","year":"1988","unstructured":"S. J. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological), 50:157\u2013224, 1988.","journal-title":"The Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matou\u00edsek","year":"1991","unstructured":"J. Matou\u00edsek and R. Thomas. Algorithms for finding tree-decompositions of graphs. J. Algorithms, 12:1\u201322, 1991.","journal-title":"J. Algorithms"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","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. Math., 9(1):101\u2013117, 1996.","journal-title":"SIAM J. Disc. Math."}],"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-36379-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:04:33Z","timestamp":1551063873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}