Optimal Junction Trees
Not on the map. Why?
Abstract (arXiv)
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal junction tree from a triangulated network. In the second part, we argue that any exact method based on local calculations must either be less efficient than the junction tree method, or it has an optimality problem equivalent to that of triangulation.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Feb 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2021Neural Trees for Learning on Graphscited by 13
- 2021Tree-Constrained Graph Neural Networks For Argument Miningcited by 2
- 2023A More General Theory of Diagnosis from First Principlescited by 0
- 2026A Recursive Decomposition Framework for Causal Structure Learning in the Presence of Latent Variablescited by 0
- 2026A Recursive Decomposition Framework for Causal Structure Learning in the Presence of Latent Variables11 May 2026
- 2023A More General Theory of Diagnosis from First Principles28 Sep 2023
- 2021Tree-Constrained Graph Neural Networks For Argument Mining2 Sep 2021
- 2021Neural Trees for Learning on Graphs15 May 2021