P H Cunningham

Suggest Changes
  • Citations Per Year
Learn More
The optimal k-restricted 2-factor problem consists of nding, in a complete undirected graph K n , a minimum cost 2-factor (subgraph having degree 2 at every node) with all components having more than(More)
  • 1