All Questions
Tagged with graph-cut algorithms
1 question
2
votes
0
answers
135
views
Minimum cost k-edge connected subgraph
The problem of finding a k-edge connected spanning subgraph with the minimum number of edges is $ \mathcal{NP} $-hard in general. Is it the case for positive weighted graphs with "fractional ...
- 21