All roads lead to Rome -- new search methods for the optimal triangulation problem

DOI10.1016/j.ijar.2012.06.006zbMath1266.68167OpenAlexW2109270084MaRDI QIDQ2375332

Thorsten J. Ottosen, Jiří Vomlel

Publication date: 13 June 2013

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2012.06.006

zbMATH Keywords

Bayesian networksprobabilistic inferenceoptimal triangulationcliques in a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

An extended depth-first search algorithm for optimal triangulation of Bayesian networks ⋮ Solving Graph Problems via Potential Maximal Cliques

Uses Software

• HUGIN
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A note on the problem of reporting maximal cliques
• Decomposition by clique separators
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Target-oriented branch and bound method for global optimization
• Finding all maximal cliques in dynamic graphs
• Enumerating all connected maximal common subgraphs in two graphs
• Anytime anyspace probabilistic inference
• Optimal decomposition by clique separators
• Clique-detection models in computational biochemistry and genomics
• Modeling and Reasoning with Bayesian Networks
• Triangulation Heuristics for BN2O Networks
• Computing the Minimum Fill-In is NP-Complete
• Triangulation of Bayesian networks by retriangulation
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs

This page was built for publication: All roads lead to Rome -- new search methods for the optimal triangulation problem