Minimal free resolutions of lattice ideals of digraphs
L O'Carroll, F Planas-Vilanova - Algebraic Combinatorics, 2018 - alco.centre-mersenne.org
Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected
graph, and a refined algorithm by Eröcal, Motsak, Schreyer and Steenpaß for computing …
graph, and a refined algorithm by Eröcal, Motsak, Schreyer and Steenpaß for computing …
[引用][C] Combinatorial divisor theory for graphs
SCF Backman - 2014 - Georgia Institute of Technology