胡伯涛《最小割模型在信息学竞赛中应用》.pdfVIP

[ADN.cn][Library]Thesis 最小割模型在信息学竞赛中的应用 Amber 最小割模型在信息学竞赛中的应用 Applications of Minimum Cut Model in Informatics 胡伯涛 Amber [ADN.cn] 福州第一中学 Fuzhou No.1 Middle School hupo001[at]gmail[dot]com 第 1 页 共 45 页 [ADN.cn][Library]Thesis 最小割模型在信息学竞赛中的应用 Amber [摘要] 本文对最小割模型的定义和性质，以及其相关扩展知识进行了研究。其中着重对最小割 模型在以下四个方面的应用展开研究：1. 基于定义的直接应用；2. 最大权闭合图；3. 最大密 度子图；4. 二分图的最小点权覆盖集和最大点权独立集。展现与剖析了最小割模型应用的巧 妙构图方法和独特思维方式，并对这一类应用的通用方法与技巧给予总结。 [关键字] 网络流，最大流，最小割，最大权闭合图，最大密度子图，二分图最小点权覆盖集，二 分图最大点权独立集 [Abstract] The purpose of the thesis is to research the definition, properties, and correlated extended knowledge of minimum cut model. The thesis sets focus on researching that is in four aspects: 1. the application based on the minimum cut model; 2. the maximum weight closure of a graph; 3. the maximum density sub graph; 4. the minimum weight vertex covering set and the maximum weight vertex independent set in the bipartite graph. It shows and analyzes the construction methods and thinking modes of the minimum cut model. Finally, it summarizes the methods and skills in the applications of the minimum cut model. [Key Words] Network Flow, Maximum Flow, Minimum Cut, Maximum Weight Closure of a Graph, Finding a Maximum Density Sub Graph, Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set , Bipartite Graph [ 目录] 0. 前言 Preface 4 1. 预备知识 Preliminaries 4 1.1. 网络与流 Network and Flow 4 1.2. 残留网络与增广路径 Residual Network and Augmenting Path 5 1.3. 最大流与最小割 Maximum Flow and Minimum Cut 6 1.4. 最小割的算法 Algorithm for Minimum Cut 8 1.5. 最大流的算法