Cycle cover problem

Cycle cover problem — задача о покрытии графа циклами.

Let $\,G = (V,E)$ be a connected undirected graph. A non-negative cost or length is associated with each edge. The cycle cover problem consists in determining a least cost cover of $\,G$ with simple cycles, each containing at least three different edges.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.