{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:53Z","timestamp":1725560813982},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_63","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"777-781","source":"Crossref","is-referenced-by-count":20,"title":["Computing and Exploiting Tree-Decompositions for Solving Constraint Networks"],"prefix":"10.1007","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P. J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence\u00a0146, 43\u201375 (2003)","journal-title":"Artificial Intelligence"},{"key":"63_CR3","unstructured":"Gottlob, G., Hutle, M., Wotawa, F.: Combining hypertree, bicomp and hinge decomposition. In: Proceedings of ECAI, pp. 161\u2013165 (2002)"},{"key":"63_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal of Discrete Mathematics\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"63_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Computing and exploiting tree-decomposition for (Max-)CSP. Technical Report LSIS.RR.2005.005 (2005), www.lsis.org","DOI":"10.1007\/11564751_63"},{"key":"63_CR7","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of UAI, pp. 7\u201315 (2001)"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R., Lueker, G.: Algorithmic Aspects of Vertex Elimination on Graphs. SIAM Journal on computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM Journal on computing"},{"key":"63_CR9","unstructured":"Berry, A.: A Wide-Range Efficient Algorithm for Minimal Triangulation. In: Proceedings of SODA (January 1999)"},{"key":"63_CR10","unstructured":"Kjaerulff, U.: Triangulation of Graphs - Algorithms Giving Small Total State Space. Technical report, Judex R.R. Aalborg., Denmark (1990)"},{"issue":"3","key":"63_CR11","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"63_CR12","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, C.P.M.: Treewidth: Computational Experiments. Technical Report 01\u201338, Berlin, Germany (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T10:13:45Z","timestamp":1586513625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11564751_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}