An All Cycle Algorithm by Computational Algebra

Giancarlo Rinaldo


We describe an algorithm to calculate all the cycles of a given undirected graph G by the algebraic technique of Gröbner basis specialized for toric ideals of semigroup algebras.

[DOI: 10.1685/CSC06132] About DOI

Full Text:



Creative Commons License   Except where otherwise noted, content on this site is
  licensed under a Creative Commons 2.5 Italy License