An algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2

Abstract

We give an algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2 and establish connections with minimal vertex covers of a simple graph. We also describe an implementation in C++ of the algorithm.