%0 Journal Article
%T Binary Join Trees
%A Prakash P. Shenoy
%J Computer Science
%D 2013
%I arXiv
%X 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.
%U http://arxiv.org/abs/1302.3604v1