Heuristic Algorithms for the Triangulation of Graphs

@inproceedings{Cano1994HeuristicAF,
  title={Heuristic Algorithms for the Triangulation of Graphs},
  author={Andr{\'e}s Cano and Seraf{\'i}n Moral},
  booktitle={IPMU},
  year={1994}
}
Dierent uncertainty propagation algorithms in graph-ical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from dierent triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resulting triangulated graph. The problem of obtaining an optimum graph triangulation is known to be NP-complete. Thus approximate algorithms which nd a good triangulation in reasonable time are of particular… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

Carmen : A software tool for probabilistic graphical models

Manuel Arias, Francisco J. Dı́ez
2006
View 4 Excerpts
Highly Influenced

Incremental Compilation of Bayesian Networks Based on Maximal Prime Subgraphs

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems • 2011
View 4 Excerpts
Highly Influenced

Ordering strategies for removing redundant fill edges

2014 IEEE International Advance Computing Conference (IACC) • 2014
View 1 Excerpt

81 Citations

01020'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Evaluating in uence diagrams

D. ShachterR.
Operations Research • 1986

Probability Propagation

P. ShenoyP.
Annals of Mathematical and Arti cial Intelligence

Similar Papers

Loading similar papers…