搜索结果: 1-1 共查到“理学 Minimum k-path vertex cover”相关记录1条 . 查询时间(0.049 秒)
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by k(G)the minimum cardinality of a k-path vertex cover i...