- G is an undirected connected graph
- G has M edges
- Every edge has it's weight/cost
- Every edge has it's color - black or white
How should I find Minimal Cost Spanning Tree with exactly K white edges? What would the complexity be?
Thanks in advance.
This post has been edited by viktor.slavkovic: 18 April 2013 - 03:53 PM