Cycle cover problem: различия между версиями

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

Let <math>\,G = (V,E)</math> be a [[connected graph|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 <math>\,G</math> with [[simple cycle|simple cycles]], each containing at least three different edges.

 

 

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