Abstract:
The problem of finding a maximal flat part of a separable undirected graph is considered. It is shown that this problem can be represented as an optimization problem on a fragmented structure. An evolutionary-fragmented algorithm for finding approximate solutions of the problem is proposed.
Keywords:graph, maximally flat part of graph, isometric cycles, fragmented structure, evolutionarily-fragmented algorithm.
Fulltext:
PDF file (647 kB)