pairwise disjoint set 两两不相交集
jointly exhaustive and pairwise disjoint 互不相交且联合完备
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
youdao
应用推荐
模块上移
模块下移
不移动