News
Abstract: The k-edge-connectivity augmentation problem for a specified set of vertices (kECA-SV) is defined as follows: "Given an undirected graph G=(V, E), a subgraph G'=(V, E') of G, a specified set ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback