ABSTRACT
Let G be a connected bipartite graph. We present an approach to compute the canonical module of the edge subring K[G] using linear programming techniques and study the Gorenstein property and the type of K[G]. The a-invariant of K[G] will be interpreted in combinatorial optimization terms as the maximum number of edge disjoint directed cuts.
