An algorithm for finding a maximum t-matching excluding complete partite subgraphs
An algorithm for finding a maximum t-matching excluding complete partite subgraphs
复制标题
一种查找排除完整分图的最大 t 匹配的算法
作者：
Y.Kobayashi;X.Yin
