Joint graphs are currently the primary way to define the global structure of algebraic Bayesian networks. In this paper, we give an overview of a direct algorithm for the synthesis of a minimal joint graph and carry out its asymptotic analysis. We also describe ways to achieve maximum efficiency. From a theoretical point of view, the problem has not been discussed previously.