搜索结果: 1-1 共查到“计算数学 Matchings”相关记录1条 . 查询时间(0.303 秒)
Computing the partition function for perfect matchings in a hypergraph
hypergraph perfect matching partition function permanent
2010/12/6
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V =S1 [ . . . [ Sm into pairwise disjoint k-subsets Si.