A sufficiently fast algorithm for finding close to optimal clique trees-Reference-Cited by-同舟云学术

A sufficiently fast algorithm for finding close to optimal clique trees

Published:2001-01 Issue:1-2 Volume:125 Page:3-17
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Becker Ann,Geiger Dan

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference21 articles.

1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability;Arnborg;BIT,1985

2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic and Discrete Methods,1987

3. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991

4. Characterization and recognition of partial 3-trees;Arnborg;SIAM J. Algebraic and Discrete Methods,1986

5. Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem;Becker;Artificial Intelligence,1996

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Experience Report on the Optimization of the Product Configuration System of Renault ^*;2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS);2023-06-14

2. An Efficient Approach for Parameters Learning of Bayesian Network with Multiple Latent Variables Using Neural Networks and P-EM;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021

3. Tree decompositions and social graphs;Internet Mathematics;2016-05-16

4. Research on Probabilistic Safety Analysis Approach of Flight Control System Based on Bayesian Network;Procedia Engineering;2015

5. Pure Nash Equilibria in Graphical Games and Treewidth;Algorithmica;2014-08-22