Heuristic Algorithms for the Triangulation of Graphs (1995)
| Citations: | 21 - 3 self |
BibTeX
@MISC{Cano95heuristicalgorithms,
author = {Andrés Cano and Serafin Moral},
title = {Heuristic Algorithms for the Triangulation of Graphs},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Different uncertainty propagation algorithms in graphical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from different triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resu lting triangulated graph. The prob lem of obtaining an optimum graph triangu lation is known to be NP-complete. Thus approximate algorithms which find a good triangulation in reasonable time are of particular interest. This work describes and compares several heuristic algorithms developed for this purpose.
Keyphrases
heuristic algorithm particular interest prob lem approximate algorithm propagation algorithm different uncertainty propagation algorithm original graph different triangulation reasonable time several heuristic algorithm particular case resu lting joint tree graphical structure optimum graph triangu lation good triangulation work describes
