Probabilistic Graphical Models

Finding the optimal tree skeletonCan reduce to following problem:Given graph G = (V,E), and nonnegative weights w e foreach edge e=(X i ,X j )In our case: w e = I(X i ,X j )Want to find tree T⊆ E that maximizes ∑ e∈T w eMaximum spanning tree problem!Can solve in time O(|E| log |E|)!40