UC知道求助，论文再要翻译（图论方面的）谢谢！
来源：百度知道 编辑：UC知道 时间：2024/06/02 20:17:43
我大四学生，正在写论文，老师对摘要要求满高的，我的通不过（我的英语非常差），想麻烦高手帮我修改一下或重新翻译一下！谢谢！我的邮箱是skywhcsea@163.com
偶图及应用
摘 要：偶图是图论中的一种特殊模型。在许多实际应用中，最终都将归结为偶图的完美对集或更一般地求饱和 中每个点的一个对集。匈牙利算法给出了求最大对集算法，而库恩—曼克莱特算法提出了在赋权全偶图中寻找最优对集的一个算法。论文中讨论了一个任务安排问题，并给出了可以实现该问题的C程序。
关键词：偶图，匈牙利算法，库恩—曼克莱特算法,C
BIPARTIE GRAPH THEORY WITH APPLICATIONS
Abstract：Bipartite graph is a special model in the Graph Theory. In many practical applications, will ultimately boil down to a perfect matching or more generally for X saturation point in each of a matching. Hungary algorithm is used for finding the largest matchings, and Kuhn and Munkres find an optimal matching in a weighted complete bipartite graph. Papers discussed in a task arrangements, and can be given to the issue of C program.
Keywords：Bipartite graph, The Hungarian method, The Kuhn-Munkres algorithm，C
相关专业词汇：
偶图：Bipartite graph 对集：matching 库恩—曼克莱特算法：The Kuhn-Munkres algorithm 匈牙利算法：The Hungarian method
偶图及应用
摘 要：偶图是图论中的一种特殊模型。在许多实际应用中，最终都将归结为偶图的完美对集或更一般地求饱和 中每个点的一个对集。匈牙利算法给出了求最大对集算法，而库恩—曼克莱特算法提出了在赋权全偶图中寻找最优对集的一个算法。论文中讨论了一个任务安排问题，并给出了可以实现该问题的C程序。
关键词：偶图，匈牙利算法，库恩—曼克莱特算法,C
BIPARTIE GRAPH THEORY WITH APPLICATIONS
Abstract：Bipartite graph is a special model in the Graph Theory. In many practical applications, will ultimately boil down to a perfect matching or more generally for X saturation point in each of a matching. Hungary algorithm is used for finding the largest matchings, and Kuhn and Munkres find an optimal matching in a weighted complete bipartite graph. Papers discussed in a task arrangements, and can be given to the issue of C program.
Keywords：Bipartite graph, The Hungarian method, The Kuhn-Munkres algorithm，C
相关专业词汇：
偶图：Bipartite graph 对集：matching 库恩—曼克莱特算法：The Kuhn-Munkres algorithm 匈牙利算法：The Hungarian method
Bipartite Graph and Application
Abstract:
Bipartite Graph is a special model in the Graph Theory. In the various practical applications, its ultimate resolution is the perfect matching of Bipartite Graph or more generally seeking a matching for every point in the X saturation. The Hungarian Algorithm is a method for finding the largest matching, while the Kuhn and Munkres Algorithm suggests a method of seeking the best matching in the complete weighted Bipartite Graph. This paper discusses the issue of a task arrangement, and provides a C program to realize that issue.
Key Words : Bipartite Graph, the Hungarian Algorithm, the Kuhn and Munkres Algorithm, C program