Abstract
Given a connected and weighted graph G = (V, E) with each vertex v having a nonnegative weight w(v), the minimum weighted connected vertex cover P-3 p......
小提示:本篇文献需要登录阅读全文,点击跳转登录