11381 search results - page 266 / 2277 » Connectivity |
CORR
2010
Springer
15 years 6 months ago
2010
Springer
113
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. I...
NECO
2007
15 years 6 months ago
2007
