Cycle cover problem

Материал из WikiGrapp
Перейти к:навигация, поиск

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.