We provide relation-algebraic characterisations of elementary, ordinary, and maximal cycles in graphs. Relational specifications for the enumeration of cycles are provided. They are executable within the REL VIEW and RELCLIPSE tools and appear to he useful in various applications. Particularly, cycles offer a valuable instrument for analysing Petri Nets. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Fronk, A., & Pleumann, J. (2006). On relational cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3929 LNCS, pp. 83–95). https://doi.org/10.1007/11734673_7
Mendeley helps you to discover research relevant for your work.