$b$ -匹配的Dulmage-Mendelsohn分解
The Dulmage-Mendelsohn Decomposition for $b$-Matchings
摘要:
建立了$b$ -匹配的Dulmage-Mendelsohn分解理论。原始的Dulmage-Mendelsohn分解是二部图的一个经典的标准分解,它描述了最大$1$ -匹配和对偶优化器的结构,即,最小顶点覆盖本文利用类比性质,得到了最大$b$ -匹配的结构,刻画了$b$ -验证集族.
英文摘要:
We establish the theory of the Dulmage-Mendelsohn decomposition for $b$-matchings. The original Dulmage-Mendelsohn decomposition is a classical canonical decomposition of bipartite graphs, which describes the structures of the maximum $1$-matchings and the dual optimizers, i.e., the minimum vertex covers. In this paper, we develop analogical properties, and thus obtain the structure of the maximum $b$-matchings and characterizes the family of $b$-verifying set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。