All roads lead to Rome - New search methods for the optimal triangulation problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F12%3A00384920" target="_blank" >RIV/67985556:_____/12:00384920 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ijar.2012.06.006" target="_blank" >http://dx.doi.org/10.1016/j.ijar.2012.06.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ijar.2012.06.006" target="_blank" >10.1016/j.ijar.2012.06.006</a>
Alternative languages
Result language
angličtina
Original language name
All roads lead to Rome - New search methods for the optimal triangulation problem
Original language description
To perform efficient inference in Bayesian networks by means of a Junction Tree method, the network graph needs to be triangulated. The quality of this triangulation largely determines the efficiency of the subsequent inference, but the triangulation problem is unfortunately NP-hard. It is common for existing methods to use the treewidth criterion for optimality of a triangulation. However, this criterion may lead to a somewhat harder inference problem than the total table size criterion. We therefore investigate new methods for depth-first search and best-first search for finding optimal total table size triangulations. The search methods are made faster by efficient dynamic maintenance of the cliques of a graph. This problem was investigated by Stix,and in this paper we derive a new simple method based on the Bron-Kerbosch algorithm that compares favourably to Stix' approach. The new approach is generic in the sense that it can be used with other algorithms than just Bron-Kerbosch.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Approximate Reasoning
ISSN
0888-613X
e-ISSN
—
Volume of the periodical
53
Issue of the periodical within the volume
9
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
1350-1366
UT code for WoS article
000311461700005
EID of the result in the Scopus database
—