Abstract
Let G = (V, E) be an undirected multigraph without loops. The maximum cycle packing problem is to find a collection Z* = {C-1,...,C-s} of edge-disjoin......
小提示:本篇文献需要登录阅读全文,点击跳转登录