Binary Join Trees

2013/02/13 by Prakash P. Shenoy, Shenoy, Prakash P.
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.1302.3604

openalex publication_date 2013/02/13 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28

Abstract

The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and sketch a procedure for constructing them.

Related

• A Verified Cost Analysis of Joinable Red-Black Trees
• Joins via Geometric Resolutions: Worst-case and Beyond
• A Time and Space Efficient Junction Tree Architecture
• Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm
• Compound Binary Search Tree and Algorithms