k边连通有向图
基于1个网页-相关网页
k-edge-connected directed graph
以上为机器翻译结果，长、整句建议使用 人工翻译 。
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边连通有向图这一优化问题。
youdao
应用推荐
模块上移
模块下移
不移动