排序方式: 共有1条查询结果,搜索用时 125 毫秒
1
1.
Journal of Combinatorial Optimization - In the k-terminal cut problem, we are given a graph with edge weights and k distinct vertices called “terminals.” The goal is to remove a minimum... 相似文献
1