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

Authors

390

  1. LB
    Luboš Brim

    Masaryk University, Czechia

    3 publications · 52 citations

    3

    h-index

  2. RD
    Rafael Dueire Lins

    Universidade Federal de Pernambuco, Brazil

    3 publications · 144 citations

    3

    h-index

  3. AH
    Amir H. Banihashemi

    Carleton University, Canada

    3 publications · 113 citations

    3

    h-index

  4. TR
    Thomas Reps

    University of Wisconsin–Madison, United States

    3 publications · 654 citations

    3

    h-index

  5. PH
    Paul H. J. Kelly

    Imperial College London, United Kingdom

    2 publications · 93 citations

    2

    h-index

1–5 of 390

Venues

  1. Information Processing Letters

    7 publications · 361 citations

    7

    h-index

  2. ACM Transactions on Algorithms

    TALG · 4 publications · 183 citations

    4

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 4 publications · 73 citations

    4

    h-index

  4. Journal of Computer and System Sciences

    3 publications · 78 citations

    3

    h-index

  5. Discrete Applied Mathematics

    3 publications · 40 citations

    3

    h-index

1–5