2007/03/13 by Giuseppa Carrá Ferro, Giuseppa Carrà Ferro, Ferro, Giuseppa Carrá +2
Computer Science · Mathematics · #Combinatorics (math.CO) #Commutative Algebra (math.AC) #Computability, Logic, AI Algorithms #FOS: Mathematics #Formal Methods in Verification #Polynomial and algebraic computation #math.AC #math.CO
paper · pdf · doi:10.48550/arxiv.math/0703381
25 pages
arxiv created 2007/03/13 · openalex publication_date 2007/03/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph D in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic reasoning on cycles and directed cycles of graphs.