Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families