Premium
An algorithm for the longest cycle problem
Author(s) -
Dixon E. T.,
Goodman S. E.
Publication year - 1976
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230060206
Subject(s) - simple (philosophy) , algorithm , enhanced data rates for gsm evolution , mathematics , computer science , scheme (mathematics) , undirected graph , mathematical optimization , combinatorics , graph , artificial intelligence , mathematical analysis , philosophy , epistemology
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.