搜索结果: 1-1 共查到“几何学 Hardness”相关记录1条 . 查询时间(0.015 秒)
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Network survivability Graph connectivity
2012/12/3
Given a k-connected graph G = (V ,E) and V 伡 V , k-Vertex-Connected Subgraph Augmentation Problem (k-VCSAP) is to find S 伡 V \ V with minimum
cardinality such that the subgraph induced by V 伨 S ...