arXiv · 1307.7224
An algorithm for computing the universal Gr\"obner Basis of graph ideals
Abstract
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal corresponding to an undirected graph, based on the theoretically knowledge of this set and on a recent, efficiently computable algorithmic characterization of the Graver basis of the ideal.
Explore related subjects
Keep this discovery
Yannis C. Stamatiou, Christos Tatakis. 2013-07-27. An algorithm for computing the universal Gr\"obner Basis of graph ideals. https://arxiv.org/abs/1307.7224
Cite the original work for its findings. Save a collection to share your selection of sources.