Abstract
An edge-weighted graph G is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable g......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
