Triangulation Heuristics for BN2O Networks

DOI10.1007/978-3-642-02906-6_49zbMath1245.62019OpenAlexW2105965379MaRDI QIDQ3638179

Petr Savický, Jiří Vomlel

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_49

Mathematics Subject Classification ID

Bayesian inference (62F15) Applications of graph theory (05C90) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ Unnamed Item ⋮ Triangulation Heuristics for BN2O Networks

Cites Work

• A partial k-arboretum of graphs with bounded treewidth
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Triangulation Heuristics for BN2O Networks
• Computing the Minimum Fill-In is NP-Complete
• Efficient computation for the noisy MAX
• Unnamed Item

This page was built for publication: Triangulation Heuristics for BN2O Networks