Algorithmic computation of the Universal Gr？bner Basis of toric ideals of graphs

Let $G$ be an undirected graph and $I_G$ be its corresponding toric ideal. In this paper we give an algorithm that outputs its Universal Gr\"obner basis based on a recent, efficiently computable algorithmic characterization of its the Graver basis.