# Binary Join Trees

arXiv: https://arxiv.org/abs/1302.3604 · HTML: https://mlsanity.com/paper/1302.3604/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Feb 2013.

## Built on by (most cited first, 1 of 1)

- [Causal Inference Using Tractable Circuits](https://mlsanity.com/paper/2202.02891/) (2022)

## Abstract (arXiv)

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.