{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:36Z","timestamp":1725543396981},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_24","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"255-266","source":"Crossref","is-referenced-by-count":12,"title":["A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth"],"prefix":"10.1007","author":[{"given":"Emgad H.","family":"Bachoore","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, UAI 2001, Seattle, Washington, USA, pp. 7\u201315 (2001)"},{"key":"24_CR2","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 Journal on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11427186_20","volume-title":"Experimental and Efficient Algorithms","author":"E. Bachoore","year":"2005","unstructured":"Bachoore, E., Bodlaender, H.L.: New heuristics for upper bound of treewidth. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 216\u2013227. Springer, Heidelberg (2005)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(00)00075-8","volume":"125","author":"A. Becker","year":"2001","unstructured":"Becker, A., Geiger, D.: A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence Journal\u00a0125, 3\u201317 (2001)","journal-title":"Artificial Intelligence Journal"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1111\/j.1467-8640.2005.00274.x","volume":"21","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence\u00a021(3), 286\u2013305 (2005)","journal-title":"Computational Intelligence"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"24_CR7","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.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"24_CR8","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011(1-2), 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1027320705349","volume":"7","author":"H.L. Bodlaender","year":"2003","unstructured":"Bodlaender, H.L.: Necessary edges in k-chordalizations of graphs. Journal of Combinatorial Optimization\u00a07, 283\u2013290 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-540-30140-0_56","volume-title":"Algorithms \u2013 ESA 2004","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 628\u2013639. Springer, Heidelberg (2004)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-36379-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Eijkhof van den","year":"2002","unstructured":"van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 176\u2013185. Springer, Heidelberg (2002)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F. Clautiaux","year":"2004","unstructured":"Clautiaux, F., Moukrim, A., N\u00e9gre, S., Carlier, J.: Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Operations Research\u00a038, 13\u201326 (2004)","journal-title":"RAIRO Operations Research"},{"key":"24_CR13","first-page":"201","volume-title":"Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence","author":"V. Gogate","year":"2004","unstructured":"Gogate, V., Dechter, R.: A complete any time algorithm for treewidth. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, Banff, Canada, pp. 201\u2013208. AUAI Press, Arlington (2004)"},{"key":"24_CR14","volume-title":"Electronic Notes in Discrete Mathematics","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.: Treewidth: Computational experiments. In: Electronic Notes in Discrete Mathematics, vol.\u00a08. Elsevier, Amsterdam (2001)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/S0895480195280010","volume":"10","author":"S. Ramachandramurthi","year":"1997","unstructured":"Ramachandramurthi, S.: The structure and number of obstructions to treewidth. SIAM J. Disc. Math.\u00a010, 146\u2013157 (1997)","journal-title":"SIAM J. Disc. Math."},{"key":"24_CR16","unstructured":"R\u00f6hrig, H.: Tree decomposition: A feasibility study. Master\u2019s thesis, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:39Z","timestamp":1619507679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11775096_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}