Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example Kruskals algorithm. The efficiency of the algorithm makes it tractable for high-dimensional problems.