Abstract
We solve the following problem: Can an undirected weighted graph G be partitioned into two nonempty induced subgraphs satisfying minimum constraints f......
小提示:本篇文献需要登录阅读全文,点击跳转登录