The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
应用推荐