An algorithm for the longest cycle problem
E. Dixon, S. E. Goodman · Networks · 1976
Abstract An algorithm is presented which solves the problem of finding the longest simple cycle in an undirected edge‐weighted network. The properties of the vector spaces associated with the fundamental cycles of a network are used to develop a suitable algorithm for finding simple cycles, and this is imbedded into a branch and bound scheme that solves the longest cycle problem.