EFFICIENT PARALLEL ALGORITHMS FOR FINDING CHORDLESS CYCLES IN GRAPHS
N. CHANDRASEKHARAN, V. S. Lakshmanan, Muralidhar Medidi · Parallel Processing Letters · 1993
We present simple and efficient parallel algorithms for obtaining a chordless cycle of length greater than or equal to k in a graph whenever such a cycle exists. Our results generalize and simplify existing results for detecting chordless cycles.