{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:04:58Z","timestamp":1747580698264,"version":"3.30.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4588,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0004-3702(00)00075-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:57:34Z","timestamp":1027616254000},"page":"3-17","source":"Crossref","is-referenced-by-count":28,"title":["A sufficiently fast algorithm for finding close to optimal clique trees"],"prefix":"10.1016","volume":"125","author":[{"given":"Ann","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Geiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00075-8_BIB001","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB002","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB003","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB004","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB005","first-page":"1","article-title":"Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem","volume":"82","author":"Becker","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB006","series-title":"Proc. 17th International Workshop, WG'91, Fischbachau, Germany","article-title":"Approximating treewidth, pathwidth, and minimum elimination tree height, Graph-theoretic concepts in computer science","volume":"570","author":"Bodlaender","year":"1991"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB007","series-title":"Proc. 25th ACM STOC","first-page":"226","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","author":"Bodlaender","year":"1993"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB008","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/dimacs\/005\/07","article-title":"The optimal multiterminal cut problem","volume":"5","author":"Cunningham","year":"1991","journal-title":"Discrete Mathematics and Theoretical Computer Science (DIMACS Series)"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB009","series-title":"Proc. 24th Annual ACM STOC","first-page":"241","article-title":"The complexity of multiway cuts","author":"Dahlhaus","year":"1994"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB010","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB011","series-title":"Proc. Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel","first-page":"487","article-title":"Multiway cuts in directed and node weighted graphs","volume":"820","author":"Garg","year":"1994"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB012","first-page":"269","article-title":"Bayesian updating in causal probabilistic networks by local computations","volume":"4","author":"Jensen","year":"1990","journal-title":"Computational Statistics Quarterly"},{"year":"1990","series-title":"Triangulation of graph-algorithms giving small total state space","author":"Kj\u00e6rulff","key":"10.1016\/S0004-3702(00)00075-8_BIB013"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB014","series-title":"Treewidth","volume":"842","author":"Kloks","year":"1994"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB015","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/jagm.1996.0002","article-title":"Efficient parallel algorithms for graphs of bounded treewidth","volume":"20","author":"Lagergren","year":"1996","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0004-3702(00)00075-8_BIB016","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their application to expert systems (with discussion)","volume":"50","author":"Lauritzen","year":"1988","journal-title":"J. Roy. Statist. Soc. B"},{"year":"1988","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","key":"10.1016\/S0004-3702(00)00075-8_BIB017"},{"issue":"3","key":"10.1016\/S0004-3702(00)00075-8_BIB018","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","article-title":"Fusion, propagation and structuring in belief networks","volume":"29","author":"Pearl","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB019","series-title":"Proc. 24th Annual Symposium on Theory of Computing","first-page":"221","article-title":"Finding approximate separators and computing treewidth quickly","author":"Reed","year":"1992"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB020","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII. The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Combinatorial Theory B"},{"key":"10.1016\/S0004-3702(00)00075-8_BIB021","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1974","journal-title":"J. Math. Anal. Appl."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000758?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000758?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T16:51:18Z","timestamp":1733331078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0004370200000758"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00075-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}