Method of determining the longest simple chain in a graph with the use of a genetic algorithm
Łukasz Mielniczuk, Łukasz Strzelecki · Przegląd Teleinformatyczny · 2018
This paper discusses the issue of determining the longest simple chain in a graph by using a heuristic algorithm – a genetic algorithm. A method enabling the effective determination of the longest chain in any connected, undirected graph without loops.