complete matching A matching in a bipartite graph in which all vertices are used. This requires each set to have the same number of vertices, n, and the complete matching will have n edges.
complete matching
数学辞典收录了4151条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。