An All Cycle Algorithm by Computational Algebra

Authors

  • Giancarlo Rinaldo

DOI:

https://doi.org/10.1685/

Abstract

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

Downloads

Published

2007-10-01

Issue

Vol. 2 (2007)

Section

Articles

License

Authors who submit to this journal agree to the following terms: a) Authors retain copyright over their work, while allowing the SIMAI to place this accepted work under a Creative Commons Attribution License (CC license), which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship. b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book). with an acknowledgement of its initial publication on “Communications to SIMAI Congress”. c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website).