Cycle Detection
Cycle Detection is a computational method used in the analysis of linked data structures to identify the presence of a circular path within a sequence of nodes, distinguishing it from acyclic traversal by determining whether a traversal revisits any node due to a backward or cross edge.
157
Publications
6.4K
Citations
390
Authors
222
Institutions
Publications per year
2017–2026
30
157
Analysis of recursive state machines
Rajeev Alur, Michael Benedikt, Kousha Etessami et al. · ACM Transactions on Programming Languages and Systems · 2005 · 220 citations · Full text
An algorithm for finding a fundamental set of cycles of a graph
Keith Paton · Communications of the ACM · 1969 · 172 citations · Full text
1–5 of 157
390
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 390
222

Tel Aviv University
Tel Aviv, Israel
5 h-index
6 publications
621 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
194 citations
Princeton University
Princeton, United States
4 h-index
5 publications
249 citations

Masaryk University
Brno, Czechia
4 h-index
13 publications
212 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
7 publications
160 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
14 publications
247 citations
University of Wisconsin–Madison
Madison, United States
3 h-index
3 publications
654 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
191 citations
1–8 of 222
7 publications · 361 citations
7
h-index
TALG · 4 publications · 183 citations
4
h-index
ENTCS · 4 publications · 73 citations
4
h-index
3 publications · 78 citations
3
h-index
3 publications · 40 citations
3
h-index
1–5