Abstract
We study the following basic problem called BI-COVERING. Given a graph G(V, E), find two (not necessarily disjoint) sets A subset of V and B subset of......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
