| 第11行： |
第11行： |
| | | | |
| | | | |
| − | 对于二分图常用的表达方式是<math>G=(U,V,E)</math>，其中<math>U</math>和<math>V</math>分别代表顶点子集，<math>E</math>代表二分图中的连边。如果有一个二分图内部不连通，那么它可能具有多个二分图；在这种情况下，<math>(U,V,E)</math>标注将有助于指定一个特殊的二分图。在实际的应用当中这一点是很重要的。如果<math>|U|=|V|</math>，即这两个子集具有相同的基数，此时<math>G</math>被称为'''均衡二分图 Balanced bipartite graph'''。如果在二分图中同一侧（同一个子集）所有的顶点都具有相同的度数，则<math>G</math>被称为'''双正则二分图 Biregular'''。 | + | 对于二分图常用的表达方式是<math>G=(U,V,E)</math>，其中<math>U</math>和<math>V</math>分别代表顶点子集，<math>E</math>代表二分图中的连边。如果有一个二分图内部不连通，那么它可能具有多个二分图；<ref>{{citation | last1 = Chartrand | first1 = Gary | last2 = Zhang | first2 = Ping | | isbn = 9781584888000 | page = 223 | publisher = CRC Press | series = Discrete Mathematics And Its Applications | title = Chromatic Graph Theory | url = https://books.google.com/books?id=_l4CJq46MXwC&pg=PA223 | volume = 53 | year = 2008}}.</ref>在这种情况下，<math>(U,V,E)</math>标注将有助于指定一个特殊的二分图。在实际的应用当中这一点是很重要的。如果<math>|U|=|V|</math>，即这两个子集具有相同的基数，此时<math>G</math>被称为'''均衡二分图 Balanced bipartite graph'''。如果在二分图中同一侧（同一个子集）所有的顶点都具有相同的度数，则<math>G</math>被称为'''双正则二分图 Biregular'''。 |
| | | | |
| | | | |
| 第20行： |
第20行： |
| | When modelling relations between two different classes of objects, bipartite graphs very often arise naturally. For instance, a graph of football players and clubs, with an edge between a player and a club if the player has played for that club, is a natural example of an affiliation network, a type of bipartite graph used in social network analysis. | | When modelling relations between two different classes of objects, bipartite graphs very often arise naturally. For instance, a graph of football players and clubs, with an edge between a player and a club if the player has played for that club, is a natural example of an affiliation network, a type of bipartite graph used in social network analysis. |
| | | | |
| − | 在建立两类不同对象之间的关系时，人们常常会很自然地选择二分图。以建立足球运动员和俱乐部的关系图为例，如果该球员曾为该俱乐部效力，那么在运动员和俱乐部之间就形成了一条边。这是二分图在建立隶属关系网络中的应用示例。在社交网络分析中，隶属关系便形成一种二分图。 | + | 在建立两类不同对象之间的关系时，人们常常会很自然地选择二分图。以建立足球运动员和俱乐部的关系图为例，如果该球员曾为该俱乐部效力，那么在运动员和俱乐部之间就形成了一条边。这是二分图在建立隶属关系网络中的应用示例。在社交网络分析中，隶属关系便形成一种二分图。<ref>{{citation | last1 = Wasserman | first1 = Stanley | last2 = Faust | first2 = Katherine | isbn = 9780521387071 | pages = 299–302 | publisher = Cambridge University Press |
| | + | | series = Structural Analysis in the Social Sciences | title = Social Network Analysis: Methods and Applications | url = https://books.google.com/books?id=CAm2DpIqRUIC&pg=PA299 | volume = 8 | year = 1994}}.</ref> |
| | | | |
| | | | |
| | + | 自觉选用二分图的另一个例子是（NP-完全问题）铁路优化问题，其中输入项是火车的时间表及其停靠点，目标是找到尽可能小的火车站集合，以便每个火车都可以停靠至少一个选定的火车站。我们可以运用建模将这个问题转化为一个二分图中的主导集合问题，该图中每辆列车和每个车站都被看作是一个顶点，而当某列车停靠在某车站的时候，它们所形成的关系可看作一条连边。<ref name=niedermeier2006invitiation>{{citation|last=Niedermeier|first=Rolf|title=Invitation to Fixed Parameter Algorithms|series=Oxford Lecture Series in Mathematics and Its Applications|year=2006|publisher=Oxford University Press|isbn=978-0-19-856607-6|pages=20–21}}</ref> |
| | | | |
| − | Another example where bipartite graphs appear naturally is in the (NP-complete) railway optimization problem, in which the input is a schedule of trains and their stops, and the goal is to find a set of train stations as small as possible such that every train visits at least one of the chosen stations. This problem can be modeled as a dominating set problem in a bipartite graph that has a vertex for each train and each station and an edge for each pair of a station and a train that stops at that station.[7]
| |
| | | | |
| − | Another example where bipartite graphs appear naturally is in the (NP-complete) railway optimization problem, in which the input is a schedule of trains and their stops, and the goal is to find a set of train stations as small as possible such that every train visits at least one of the chosen stations. This problem can be modeled as a dominating set problem in a bipartite graph that has a vertex for each train and each station and an edge for each pair of a station and a train that stops at that station.[7]
| + | 第三个例子涉及到货币金融学领域。古代的硬币被设计为正反两面，不同时期和地区的政府会使用不同的正反面组合，因此，将所有可能的组合画成图就是一个二分图的结构。<ref name=bracey2012>{{cite article|last=Bracey|first=Robert|title=On the Graphical Interpreation of Herod's Coinage in Judaea and Rome in Coins|year=2012|url=https://www.academia.edu/2078897|pages=65–84}}</ref> |
| | | | |
| − | 自觉选用二分图的另一个例子是（NP-完全问题）铁路优化问题，其中输入项是火车的时间表及其停靠点，目标是找到尽可能小的火车站集合，以便每个火车都可以停靠至少一个选定的火车站。我们可以运用建模将这个问题转化为一个二分图中的主导集合问题，该图中每辆列车和每个车站都被看作是一个顶点，而当某列车停靠在某车站的时候，它们所形成的关系可看作一条连边。
| |
| − |
| |
| − |
| |
| − |
| |
| − | A third example is in the academic field of numismatics. Ancient coins are made using two positive impressions of the design (the obverse and reverse). The charts numismatists produce to represent the production of coins are bipartite graphs.<ref name=bracey2012>{{cite article|last=Bracey|first=Robert|title=On the Graphical Interpreation of Herod's Coinage in Judaea and Rome in Coins|year=2012|url=https://www.academia.edu/2078897|pages=65–84}}</ref>
| |
| − |
| |
| − | A third example is in the academic field of numismatics. Ancient coins are made using two positive impressions of the design (the obverse and reverse). The charts numismatists produce to represent the production of coins are bipartite graphs.
| |
| − |
| |
| − | 第三个例子涉及到货币金融学领域。古代的硬币被设计为正反两面，不同时期和地区的政府会使用不同的正反面组合，因此，将所有可能的组合画成图就是一个二分图的结构。
| |
| − |
| |
| − |
| |
| − |
| |
| − | More abstract examples include the following:
| |
| − |
| |
| − | More abstract examples include the following:
| |
| | | | |
| | 更多抽象的例子: | | 更多抽象的例子: |
| | | | |
| − | | + | * 每个树状图都是二分的。<ref name="s12"/> |
| − | * Every [[tree (graph theory)|tree]] is bipartite.<ref name="s12"/> | + | * 具有偶数个顶点的[[环图]]都是二分的。<ref name="s12"/> |
| − | * 每个树状图都是二分的。 | |
| − | | |
| − | | |
| − | * [[Cycle graph]]s with an even number of vertices are bipartite.<ref name="s12"/>
| |
| − | * 具有偶数个顶点的环图都是二分的
| |
| − | | |
| − | | |
| − | * Every [[planar graph]] whose [[Glossary of graph theory#Genus|faces]] all have even length is bipartite. Special cases of this are [[grid graph]]s and [[squaregraph]]s, in which every inner face consists of 4 edges and every inner vertex has four or more neighbors.
| |
| | * 在平面图中，所有面都具有偶数条边，该图为二分图。特殊情况是网格图和方图，其中每个内面都有4个边，每个内顶点至少有4个相邻点。 | | * 在平面图中，所有面都具有偶数条边，该图为二分图。特殊情况是网格图和方图，其中每个内面都有4个边，每个内顶点至少有4个相邻点。 |
| | + | * 在一个完全二分图中，分别由''m''和''n''的顶点（用''K<sub>m,n</sub>''表示）组成的两个不相交的集合''U''和''V''，连边''E''由分别在集合''U''和''V''的两个顶点连接。该二分图表示为''G =（U，V，E）''，并且具有''mn''条边。另外完全二分图还有一个特例，那就是''' 冠图 Crown graphs'''。冠图是将一个完全二分图中所有的完美匹配连边去掉后形成的。<ref>{{citation | last1 = Archdeacon | first1 = D. | last2 = Debowsky | first2 = M. | last3 = Dinitz | first3 = J. |last4 = Gavlas | first4 = H. | doi = 10.1016/j.disc.2003.11.021 | issue = 1–3 | journal = Discrete Mathematics | pages = 37–43 | title = Cycle systems in the complete bipartite graph minus a one-factor | volume = 284 | year = 2004| doi-access = free }}.</ref> |
| | + | * ''' 超立方体图 Hypercube graph'''，''' 局部立方体 Partial cube'''和''' 中位数图 Median graph'''均为二分图。判别方法是将这些图中的顶点用''' 位向量Bitvector'''（二进制位组成的向量）进行标记，然后对比其中两个顶点的位向量，发现当且仅当位向量中只有一个位元是不同的时候，该两个顶点相邻。另外判定该图的二分性可以通过观察每个顶点的位向量，奇数位向量和偶数位向量分别为该图的二分顶点子集。树状图和方图都是中位数图，而所有中位数图都是局部立方体。<ref>{{citation|first=Sergei|last=Ovchinnikov|title=Graphs and Cubes|series=Universitext|publisher=Springer|year=2011}}. See especially Chapter 5, "Partial Cubes", pp. 127–181.</ref> |
| | | | |
| | | | |
| − | * The [[complete bipartite graph]] on ''m'' and ''n'' vertices, denoted by ''K<sub>n,m</sub>'' is the bipartite graph <math>G = (U, V, E)</math>, where ''U'' and ''V'' are disjoint sets of size ''m'' and ''n'', respectively, and ''E'' connects every vertex in ''U'' with all vertices in ''V''. It follows that ''K<sub>m,n</sub>'' has ''mn'' edges.
| + | == 属性 == |
| − | * 在一个完全二分图中，分别由''m''和''n''的顶点（用''Km,n''表示）组成的两个不相交的集合''U''和''V''，连边''E''由分别在集合''U''和''V''的两个顶点连接。该二分图表示为''G =（U，V，E）''，并且具有''mn''条边。另外完全二分图还有一个特例，那就是''' 冠图Crown graphs'''。冠图是将一个完全二分图中所有的完美匹配连边去掉后形成的。
| + | ===特征表述=== |
| − | | |
| − | | |
| − | * [[Hypercube graph]]s, [[partial cube]]s, and [[median graph]]s are bipartite. In these graphs, the vertices may be labeled by [[bitvector]]s, in such a way that two vertices are adjacent if and only if the corresponding bitvectors differ in a single position. A bipartition may be formed by separating the vertices whose bitvectors have an even number of ones from the vertices with an odd number of ones. Trees and squaregraphs form examples of median graphs, and every median graph is a partial cube.
| |
| − | | |
| − | * ''' 超立方体图Hypercube graph'''，''' 局部立方体Partial cube'''和''' 中位数图Median graph'''均为二分图。判别方法是将这些图中的顶点用''' 位向量Bitvector'''（二进制位组成的向量）进行标记，然后对比其中两个顶点的位向量，发现当且仅当位向量中只有一个位元是不同的时候，该两个顶点相邻。另外判定该图的二分性可以通过观察每个顶点的位向量，奇数位向量和偶数位向量分别为该图的二分顶点子集。树状图和方图都是中位数图，而所有中位数图都是局部立方体。
| |
| − | | |
| − | == Properties 属性 ==
| |
| − | === Characterization 特征表述=== | |
| − | | |
| − | Bipartite graphs may be characterized in several different ways:
| |
| − | | |
| − | Bipartite graphs may be characterized in several different ways:
| |
| − | | |
| | 二分图可以用以下几种不同的方式来描述其特征： | | 二分图可以用以下几种不同的方式来描述其特征： |
| | | | |
| 第80行： |
第47行： |
| | 注：此处翻译缺失，审校查不到文献资料直接机翻复制粘贴 | | 注：此处翻译缺失，审校查不到文献资料直接机翻复制粘贴 |
| | | | |
| − | * A graph is bipartite if and only if it is 2-colorable, (i.e. its [[chromatic number]] is less than or equal to 2).
| + | * 当且仅当图是2色系图2-colorable（即，其色数小于或等于2，详见“图着色”）时，该图为二分图。<ref name="adh98-7"/> |
| − | * 当且仅当图是2色系图2-colorable（即，其色数小于或等于2，详见“图着色”）时，该图为二分图。 | + | * 当且仅当它是二分图时，图的频谱是对称的。<ref>{{citation | last = Biggs | first = Norman | edition = 2nd | isbn = 9780521458979 | page = 53 |
| − | | + | | publisher = Cambridge University Press | series = Cambridge Mathematical Library | title = Algebraic Graph Theory | url = https://books.google.com/books?id=6TasRmIFOxQC&pg=PA53 | year = 1994}}.</ref> |
| − | * The [[Spectral graph theory|spectrum]] of a graph is symmetric if and only if it's a bipartite graph. | |
| − | * 当且仅当它是二分图时，图的频谱是对称的。
| |
| − | | |
| − | === Kőnig's theorem and perfect graphs 柯尼希定理和完美图 === | |
| − | | |
| − | In bipartite graphs, the size of minimum vertex cover is equal to the size of the maximum matching; this is Kőnig's theorem.[16][17] An alternative and equivalent form of this theorem is that the size of the maximum independent set plus the size of the maximum matching is equal to the number of vertices. In any graph without isolated vertices the size of the minimum edge cover plus the size of a maximum matching equals the number of vertices.[18] Combining this equality with Kőnig's theorem leads to the facts that, in bipartite graphs, the size of the minimum edge cover is equal to the size of the maximum independent set, and the size of the minimum edge cover plus the size of the minimum vertex cover is equal to the number of vertices.
| |
| − | | |
| − | In bipartite graphs, the size of minimum vertex cover is equal to the size of the maximum matching; this is Kőnig's theorem.[16][17] An alternative and equivalent form of this theorem is that the size of the maximum independent set plus the size of the maximum matching is equal to the number of vertices. In any graph without isolated vertices the size of the minimum edge cover plus the size of a maximum matching equals the number of vertices.[18] Combining this equality with Kőnig's theorem leads to the facts that, in bipartite graphs, the size of the minimum edge cover is equal to the size of the maximum independent set, and the size of the minimum edge cover plus the size of the minimum vertex cover is equal to the number of vertices.
| |
| − | | |
| − | 在二分图中，''' 最小顶点覆盖Minimum vertex cover'''（顶点数）等于''' 最大匹配数Maximum matching'''(边数)；这就是''' 柯尼希定理Kőnig's theorem'''。该定理的另一种等价形式是，''' 最大独立集Maximum independent set'''（顶点数）加上最大匹配数等于顶点的数量。在任意没有孤立顶点的图中，''' 最小边覆盖Minimum edge cover'''（边数）加上最大匹配数等于顶点数。于是，将以上等式与柯尼希定理相结合，得出以下事实：在二分图中，最小边覆盖数值等于最大独立集数值，最小边覆盖数值加上最小顶点覆盖数值等于顶点数。
| |
| − | | |
| − | | |
| − | | |
| − | Another class of related results concerns [[perfect graph]]s: every bipartite graph, the [[complement (graph theory)|complement]] of every bipartite graph, the [[line graph]] of every bipartite graph, and the complement of the line graph of every bipartite graph, are all perfect. Perfection of bipartite graphs is easy to see (their [[chromatic number]] is two and their [[maximum clique]] size is also two) but perfection of the [[complement (graph theory)|complements]] of bipartite graphs is less trivial, and is another restatement of Kőnig's theorem. This was one of the results that motivated the initial definition of perfect graphs.
| |
| − | | |
| − | Another class of related results concerns perfect graphs: every bipartite graph, the complement of every bipartite graph, the line graph of every bipartite graph, and the complement of the line graph of every bipartite graph, are all perfect. Perfection of bipartite graphs is easy to see (their chromatic number is two and their maximum clique size is also two) but perfection of the complements of bipartite graphs is less trivial, and is another restatement of Kőnig's theorem. This was one of the results that motivated the initial definition of perfect graphs.
| |
| − | | |
| − | 另一类相关特性与''' 完美图Perfect graph'''有关：每个二分图及其补图、线图、线图的补图均为完美图。其实关于二分图的完美性很容易就可以看出来（它们的色数为2，最大的团数同样为2），但是二分图的补图完美性的判定更简单些，且可以看作是柯尼希定理的另一种表述。其实在定义完美图这一概念的初期，它是作为其中之一的论证结果而存在的。同时完美图线图的补图完美性也是作为柯尼希定理的另一种表述，线图的完美性陈述了比较早期的柯尼希定理，即每一个二分图的着色边，其色数都等于其最大节点度数。
| |
| − | | |
| | | | |
| | | | |
| − | According to the [[strong perfect graph theorem]], the perfect graphs have a [[forbidden graph characterization]] resembling that of bipartite graphs: a graph is bipartite if and only if it has no odd cycle as a subgraph, and a graph is perfect if and only if it has no odd cycle or its [[complement (graph theory)|complement]] as an [[induced subgraph]]. The bipartite graphs, line graphs of bipartite graphs, and their complements form four out of the five basic classes of perfect graphs used in the proof of the strong perfect graph theorem.
| + | ===柯尼希定理和完美图 Kőnig's theorem and perfect graphs === |
| | | | |
| − | According to the strong perfect graph theorem, the perfect graphs have a forbidden graph characterization resembling that of bipartite graphs: a graph is bipartite if and only if it has no odd cycle as a subgraph, and a graph is perfect if and only if it has no odd cycle or its complement as an induced subgraph. The bipartite graphs, line graphs of bipartite graphs, and their complements form four out of the five basic classes of perfect graphs used in the proof of the strong perfect graph theorem.
| + | 在二分图中，''' 最小顶点覆盖Minimum vertex cover'''（顶点数）等于''' 最大匹配数Maximum matching'''(边数)；这就是''' 柯尼希定理Kőnig's theorem'''。<ref>{{citation | author = Kőnig, Dénes | title = Gráfok és mátrixok | journal = Matematikai és Fizikai Lapok | volume = 38 | year = 1931 |
| | + | | pages = 116–119}}.</ref><ref>{{citation | last1 = Gross | first1 = Jonathan L. | last2 = Yellen | first2 = Jay | edition = 2nd | isbn = 9781584885054 | page = 568 | publisher = CRC Press | series = Discrete Mathematics And Its Applications | title = Graph Theory and Its Applications |
| | + | | url = https://books.google.com/books?id=-7Q_POGh-2cC&pg=PA568 | year = 2005}}.</ref> 该定理的另一种等价形式是，''' 最大独立集Maximum independent set'''（顶点数）加上最大匹配数等于顶点的数量。在任意没有孤立顶点的图中，''' 最小边覆盖Minimum edge cover'''（边数）加上最大匹配数等于顶点数。<ref>{{citation | last1 = Chartrand | first1 = Gary | last2 = Zhang | first2 = Ping | isbn = 9780486483689 | pages = 189–190 | publisher = Courier Dover Publications | title = A First Course in Graph Theory | url = https://books.google.com/books?id=ocIr0RHyI8oC&pg=PA189 | year = 2012}}.</ref>于是，将以上等式与柯尼希定理相结合，得出以下事实：在二分图中，最小边覆盖数值等于最大独立集数值，最小边覆盖数值加上最小顶点覆盖数值等于顶点数。 |
| | | | |
| − | 根据''' 强完美图定理Strong perfect graph theorem'''，完美图具有类似于二分图的''' 禁止图特征Forbidden graph characterization'''：当且仅当它没有奇环的子图时，图才是二分的；当且仅当它没有奇环或其补图作为''' 导出子图Induced subgraph'''时，图才是完美的。二分图及其线图、补图占据了完美图五种基本类别中的四个，它们可以用于证明了强完美图定理。
| |
| | | | |
| − | === Degree 度相关问题=== | + | 另一类相关特性与''' 完美图Perfect graph'''有关：每个二分图及其补图、线图、线图的补图均为完美图。其实关于二分图的完美性很容易就可以看出来（它们的色数为2，最大的团数同样为2），但是二分图的补图完美性的判定更简单些，且可以看作是柯尼希定理的另一种表述。其实在定义完美图这一概念的初期，它是作为其中之一的论证结果而存在的。<ref>{{citation|title=Modern Graph Theory|volume= 184 |series= Graduate Texts in Mathematics|author=Béla Bollobás|publisher =Springer|year= 1998|isbn= 9780387984889|url=https://books.google.com/books?id=SbZKSZ-1qrwC&pg=PA165|page=165|author-link= Béla Bollobás }}.</ref> 同时完美图线图的补图完美性也是作为柯尼希定理的另一种表述，线图的完美性陈述了比较早期的柯尼希定理，即每一个二分图的着色边，其色数都等于其最大节点度数。 |
| | | | |
| − | For a vertex, the number of adjacent vertices is called the [[degree (graph theory)|degree]] of the vertex and is denoted <math>\deg(v)</math>.
| |
| | | | |
| − | For a vertex, the number of adjacent vertices is called the degree of the vertex and is denoted <math>\deg(v)</math>.
| + | 根据''' 强完美图定理Strong perfect graph theorem'''，完美图具有类似于二分图的''' 禁止图特征Forbidden graph characterization'''：当且仅当它没有奇环的子图时，图才是二分的；当且仅当它没有奇环或其补图作为''' 导出子图Induced subgraph'''时，图才是完美的。二分图及其线图、补图占据了完美图五种基本类别中的四个，它们可以用于证明了强完美图定理。<ref>{{citation | last1 = Chudnovsky | first1 = Maria | last2 = Robertson | first2 = Neil | last3 = Seymour | first3 = Paul | last4 = Thomas | first4 = Robin | doi = 10.4007/annals.2006.164.51 | issue = 1 | journal = Annals of Mathematics| pages = 51–229 |
| | + | | title = The strong perfect graph theorem | volume = 164 | year = 2006| citeseerx = 10.1.1.111.7265| arxiv = math/0212070| s2cid = 119151552 }}.</ref> |
| | | | |
| − | 对于一个顶点，其相邻顶点的数量称为该顶点的度数，并表示为deg（v）。二分图的总度数和公式为：
| |
| | | | |
| − | {\displaystyle \sum _{v\in V}\deg(v)=\sum _{u\in U}\deg(u)=|E|\,.}\sum_{v \in V} \deg(v) = \sum_{u \in U} \deg(u) = |E|\, .
| + | === 度相关问题=== |
| | + | 对于一个顶点，其相邻顶点的数量称为该顶点的度数，并表示为<math>\deg(v)</math>。二分图的总度数和公式为： |
| | | | |
| | + | :<math>\sum_{v \in V} \deg(v) = \sum_{u \in U} \deg(u) = |E|\, .</math> |
| | | | |
| | | | |
| − | The degree sequence of a bipartite graph is the pair of lists each containing the degrees of the two parts <math>U</math> and <math>V</math>. For example, the complete bipartite graph ''K''<sub>3,5</sub> has degree sequence <math>(5,5,5),(3,3,3,3,3)</math>. Isomorphic bipartite graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a bipartite graph; in some cases, non-isomorphic bipartite graphs may have the same degree sequence.
| + | 一个二分图的度数序列是一对列表，每个列表包含两个部分<math>U</math>和<math>V</math>的度数。例如，完全二分图''K''<sub>3,5</sub>具有度数序列 <math>(5,5,5),(3,3,3,3,3)</math>。其'''同构二分图 Isomorphic bipartite graphs'''具有相同的度数序列。但是，度数序列通常不是定义二分图的唯一方法；在某些情况下，非同构二分图可能具有相同的度数序列。 |
| | | | |
| − | The degree sequence of a bipartite graph is the pair of lists each containing the degrees of the two parts <math>U</math> and <math>V</math>. For example, the complete bipartite graph K<sub>3,5</sub> has degree sequence <math>(5,5,5),(3,3,3,3,3)</math>. Isomorphic bipartite graphs have the same degree sequence. However, the degree sequence does not, in general, uniquely identify a bipartite graph; in some cases, non-isomorphic bipartite graphs may have the same degree sequence.
| |
| | | | |
| − | 一个二分图的度数序列是一对列表，每个列表包含两个部分''U''和''V''的度数。例如，完全二分图''K3,5''具有度数序列（5,5,5），（3,3,3,3,3）。其''' 同构二分图Isomorphic bipartite graphs'''具有相同的度数序列。但是，度数序列通常不是定义二分图的唯一方法；在某些情况下，非同构二分图可能具有相同的度数序列。
| + | '''二分实现问题 Bipartite realization problem'''是通过以已知的两组自然数序列作为度数序列，来查找简单的二分图的判定问题（数理逻辑）。（尾随零可以忽略，因为通过向图添加适当数量的孤立顶点可以实现尾随为零。） |
| | | | |
| | | | |
| | + | === 与超图和有向图的关系 === |
| | | | |
| − | The [[bipartite realization problem]] is the problem of finding a simple bipartite graph with the degree sequence being two given lists of natural numbers. (Trailing zeros may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the digraph.)
| + | 一个二分图<math>(U,V,E)</math>的双邻矩阵是大小为<math>|U|\times|V|</math>的（0,1）矩阵，其分别代表了每对相邻顶点集合和非相邻顶点的集合（全零矩阵）。<ref>{{harvtxt|Asratian|Denley|Häggkvist|1998}}, p. 17.</ref>双邻接矩阵可用于描述二分图，超图和定向图之间的等价关系。 |
| | | | |
| − | The bipartite realization problem is the problem of finding a simple bipartite graph with the degree sequence being two given lists of natural numbers. (Trailing zeros may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the digraph.)
| |
| | | | |
| − | ''' 二分实现问题Bipartite realization problem'''是通过以已知的两组自然数序列作为度数序列，来查找简单的二分图的判定问题（数理逻辑）。（尾随零可以忽略，因为通过向图添加适当数量的孤立顶点可以实现尾随为零。） | + | 超图是一种类似于无向图的组合结构。它具有顶点和连边，但是其中的边可以是任意子集组的顶点，而不必具有两个端点。可以使用二分图<math>(U,V,E)</math>来建模超图，其中<math>U</math>是超图的其中一个顶点集，<math>V</math>是该超图的连边集（称为超边集），<math>E</math>包含的连边定义为：从一个超图顶点<math>v</math>到超图连边<math>e</math>恰好当<math>v</math>是<math>e</math>的端点集之一时。在这种对应关系下，二分图的双邻矩阵正好是其相应超图的关联矩阵。作为二分图和超图之间这种对应关系的特例，任何''' 多重图 Multigraph'''（即在相同两点之间可能存在的多条边的图）都可以解释为其中一些超边具有相同端点集的超图，并且由不具有多个邻接关系的二分图表示，其中二分图的同边顶点的度数均为2。<ref>{{SpringerEOM|title=Hypergraph|author=A. A. Sapozhenko}}</ref> |
| − | --[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意全文是否大写专业名词的首字母 已修改
| |
| | | | |
| − | === Relation to hypergraphs and directed graphs 与超图和有向图的关系 ===
| |
| | | | |
| − | The [[Adjacency matrix of a bipartite graph|biadjacency matrix]] of a bipartite graph <math>(U,V,E)</math> is a [[(0,1) matrix]] of size <math>|U|\times|V|</math> that has a one for each pair of adjacent vertices and a zero for nonadjacent vertices.<ref>{{harvtxt|Asratian|Denley|Häggkvist|1998}}, p. 17.</ref> Biadjacency matrices may be used to describe equivalences between bipartite graphs, hypergraphs, and directed graphs.
| + | 关于[[邻接矩阵]]的另一个相似解释可以被用于展示有向图和均衡二分图（二分子集顶点数相等）之间的一一对应关系（在给定数量的标记顶点上，允许自循环）。例如，具有<math>n</math>个顶点的有向图的邻接矩阵可以是大小为<math>n\times n</math>的任何（0,1）矩阵，然后可以将其重新解释为：具有相同顶点数<math>n</math>的同边子集的二分图的邻接矩阵。<ref>{{citation | last1 = Brualdi | first1 = Richard A. | last2 = Harary | first2 = Frank | author2-link = Frank Harary | last3 = Miller | first3 = Zevi | doi = 10.1002/jgt.3190040107 | mr = 558453 | issue = 1 | journal = Journal of Graph Theory |
| | + | | pages = 51–73 | title = Bigraphs versus digraphs via matrices | volume = 4 | year = 1980}}. Brualdi et al. credit the idea for this equivalence to {{citation | doi = 10.4153/CJM-1958-052-0 | last1 = Dulmage | first1 = A. L. | last2 = Mendelsohn | first2 = N. S. | author2-link = Nathan Mendelsohn | mr = 0097069 | journal = Canadian Journal of Mathematics | pages = 517–534 | title = Coverings of bipartite graphs | volume = 10 |
| | + | | year = 1958}}.</ref>通过这种构建方式，二分图可以被解释为是一个[[有向图]]的''' 二分双重覆盖 Bipartite double cover'''。 |
| | | | |
| − | The biadjacency matrix of a bipartite graph <math>(U,V,E)</math> is a (0,1) matrix of size <math>|U|\times|V|</math> that has a one for each pair of adjacent vertices and a zero for nonadjacent vertices. Biadjacency matrices may be used to describe equivalences between bipartite graphs, hypergraphs, and directed graphs.
| |
| | | | |
| − | 一个二分图''（U，V，E）''的双邻矩阵是大小为|''V''| 的（0,1）矩阵，其分别代表了每对相邻顶点集合和非相邻顶点的集合（全零矩阵）。双邻接矩阵可用于描述二分图，超图和定向图之间的等价关系。
| + | == 算法 == |
| | + | ===二分性测试 === |
| | | | |
| | + | 可以使用''' 深度优先搜索 Depth-first search'''来测试图是否为二分图，并在线性时间内返回双色（如果是二分图）或奇数环（如果不是二分图）。其方法的主要思想是为每个顶点分配与''' 深度优先搜索林 Depth-first search forest'''中其上级颜色不同的颜色，并在其中进行全部选择。这必定会为'''生成林 Spanning forest'''提供两种颜色，包括将顶点连接到其上级的边。不过它可能无法为非林边正确着色。在深度优先搜索林中，每个非林边缘的两个顶点之一是另一个顶点的始源，并且当深度优先搜索发现这种类型的边时，应检查这两个顶点是否具有不同的颜色。如果不是，则林中从始源到后代的路径与颜色不同的边一起会形成一个奇数环，该奇数环会从算法中返回，并输出非二分图的结果。但是，如果算法在未检测到此类奇数环的情况下终止，则必须对每个边进行适当的着色，并返回双色以及得出该图形为二分图的结果。<ref>{{citation | last = Sedgewick | first = Robert | edition = 3rd | pages = 109–111 | publisher = Addison Wesley | title = Algorithms in Java, Part 5: Graph Algorithms | year = 2004}}.</ref> |
| | | | |
| | | | |
| − | A [[hypergraph]] is a combinatorial structure that, like an undirected graph, has vertices and edges, but in which the edges may be arbitrary sets of vertices rather than having to have exactly two endpoints. A bipartite graph <math>(U,V,E)</math> may be used to model a hypergraph in which {{mvar|U}} is the set of vertices of the hypergraph, {{mvar|V}} is the set of hyperedges, and {{mvar|E}} contains an edge from a hypergraph vertex {{mvar|v}} to a hypergraph edge {{mvar|e}} exactly when {{mvar|v}} is one of the endpoints of {{mvar|e}}. Under this correspondence, the biadjacency matrices of bipartite graphs are exactly the [[incidence matrix|incidence matrices]] of the corresponding hypergraphs. As a special case of this correspondence between bipartite graphs and hypergraphs, any [[multigraph]] (a graph in which there may be two or more edges between the same two vertices) may be interpreted as a hypergraph in which some hyperedges have equal sets of endpoints, and represented by a bipartite graph that does not have multiple adjacencies and in which the vertices on one side of the bipartition all have [[degree (graph theory)|degree]] two.<ref>{{SpringerEOM|title=Hypergraph|author=A. A. Sapozhenko}}</ref>
| + | 又或者，可以使用''' 广度优先搜索 Breadth-first search'''来替代深度优先搜索进行检测。同样，在搜索林中，以广度优先的顺序为每个节点赋予与上级节点相反的颜色。如果在着色某个顶点时存在一条边，其连接了与先前着色的顶点相同的颜色。然后这条边沿着以广度优先搜索林中的路径，将其两个端点与其'''最低共有始源nLowest common ancestor'''相连，形成一条奇数环。当然，如果该算法最终没找到奇数环且终止，那么它肯定已经找到了正确的着色，可以安全返回并得出该图是二分图的结论。<ref>{{citation | last1 = Kleinberg | first1 = Jon | last2 = Tardos | first2 = Éva | pages = 94–97 | publisher = Addison Wesley | title = Algorithm Design | year = 2006}}.</ref> |
| | | | |
| − | A hypergraph is a combinatorial structure that, like an undirected graph, has vertices and edges, but in which the edges may be arbitrary sets of vertices rather than having to have exactly two endpoints. A bipartite graph <math>(U,V,E)</math> may be used to model a hypergraph in which is the set of vertices of the hypergraph, is the set of hyperedges, and contains an edge from a hypergraph vertex to a hypergraph edge exactly when is one of the endpoints of . Under this correspondence, the biadjacency matrices of bipartite graphs are exactly the incidence matrices of the corresponding hypergraphs. As a special case of this correspondence between bipartite graphs and hypergraphs, any multigraph (a graph in which there may be two or more edges between the same two vertices) may be interpreted as a hypergraph in which some hyperedges have equal sets of endpoints, and represented by a bipartite graph that does not have multiple adjacencies and in which the vertices on one side of the bipartition all have degree two.
| |
| | | | |
| − | 超图是一种类似于无向图的组合结构。它具有顶点和连边，但是其中的边可以是任意子集组的顶点，而不必具有两个端点。可以使用二分图''（U，V，E）''来建模超图，其中''U''是超图的其中一个顶点集，''V''是该超图的连边集（称为超边集），''E''包含的连边定义为：从一个超图顶点''v''到超图连边''e''恰好当''v''是''e''的端点集之一时。在这种对应关系下，二分图的双邻矩阵正好是其相应超图的关联矩阵。作为二分图和超图之间这种对应关系的特例，任何''' 多重图Multigraph'''（即在相同两点之间可能存在的多条边的图）都可以解释为其中一些超边具有相同端点集的超图，并且由不具有多个邻接关系的二分图表示，其中二分图的同边顶点的度数均为2。
| + | 对于<math>n</math>个线段的相交图或''' 欧几里得平面 Euclidean plane'''中的其他简单形状图，即使图本身可能具有多达<math>O(n^2)</math>个边缘，也可以测试其是否而二分图，并在时间<math>O(n\log n)</math>中返回双色（判定为二分图）或奇数环（判定为非二分图）。<ref>{{citation | last = Eppstein | first = David | arxiv = cs.CG/0307023 | doi = 10.1145/1497290.1497291 | issue = 2 | journal = ACM Transactions on Algorithms | mr = 2561751 | page = Art. 15 |
| | + | | title = Testing bipartiteness of geometric intersection graphs | volume = 5 | year = 2009 }}.</ref> |
| | | | |
| | | | |
| | + | ===奇环横贯 === |
| | | | |
| − | A similar reinterpretation of adjacency matrices may be used to show a one-to-one correspondence between [[directed graph]]s (on a given number of labeled vertices, allowing self-loops) and balanced bipartite graphs, with the same number of vertices on both sides of the bipartition. For, the adjacency matrix of a directed graph with {{mvar|n}} vertices can be any [[(0,1) matrix]] of size <math>n\times n</math>, which can then be reinterpreted as the adjacency matrix of a bipartite graph with {{mvar|n}} vertices on each side of its bipartition.
| + | 奇环横贯是一个''' NP完全算法问题 NP-complete algorithmic problem'''（因不能用多项式算法而使问题无法解决的），在给定图形<math>G =（V，E）</math>和数字<math>k</math>的情况下，询问是否存在一组<math>k</math>个顶点，将其从<math>G</math>移除会导致生成为二分图。<ref name=yannakakis1978node>{{citation | last = Yannakakis | first = Mihalis | contribution = Node-and edge-deletion NP-complete problems | doi = 10.1145/800133.804355 | pages = 253–264 | title = Proceedings of the 10th ACM Symposium on Theory of Computing (STOC '78) | year = 1978 | title-link = Symposium on Theory of Computing}}</ref>这个问题是''' 固定参数可解 Fixed-parameter tractable'''的，这意味着存在一种算法，其运行时间可以由图形大小的多项式函数乘以增大系数<math>k</math>来确定。奇环横贯的名称源于：当且仅当图没有奇数环时，该图是二分图。因此，为了从图中删除顶点来获得二分图，就需要“命中所有奇数环”或找到所谓的奇环横贯集合。例如在图示中，图中的每个奇数环都包含蓝色（最底部）顶点，因此删除这些顶点就相当于删除了所有奇数环并留下一个二分图。 |
| | | | |
| − | A similar reinterpretation of adjacency matrices may be used to show a one-to-one correspondence between directed graphs (on a given number of labeled vertices, allowing self-loops) and balanced bipartite graphs, with the same number of vertices on both sides of the bipartition. For, the adjacency matrix of a directed graph with vertices can be any (0,1) matrix of size <math>n\times n</math>, which can then be reinterpreted as the adjacency matrix of a bipartite graph with vertices on each side of its bipartition.
| |
| | | | |
| − | 关于''' 邻接矩阵Adjacency matrices'''的另一个相似解释可以被用于展示有向图和均衡二分图（二分子集顶点数相等）之间的一一对应关系（在给定数量的标记顶点上，允许自循环）。例如，具有''n''个顶点的有向图的邻接矩阵可以是大小为''n''×''n''的任何（0,1）矩阵，然后可以将其重新解释为：具有相同顶点数''n''的同边子集的二分图的邻接矩阵。通过这种构建方式，二分图可以被解释为是一个有向图的''' 二分双重覆盖Bipartite double cover'''。
| + | '''边二分化问题 Edge bipartization problem'''是删除尽可能少的边以使其成为二分图的问题，也是图修改算法中的重要问题。此问题同样是固定参数可解的，可以在时间<math display="inline">O\left(2^k m^2\right)</math>,内解决，<ref name=guo2006compression>{{citation | last1 = Guo | first1 = Jiong | last2 = Gramm | first2 = Jens | last3 = Hüffner | first3 = Falk | last4 = Niedermeier | first4 = Rolf | last5 = Wernicke | first5 = Sebastian | doi = 10.1016/j.jcss.2006.02.001 | journal = Journal of Computer and System Sciences | volume = 72 | issue = 8 | pages = 1386–1396 | title = Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization | year = 2006| doi-access = free }}</ref>其中''k''是要删除的边数，''m''是输入图中的边数。 |
| − | | |
| − | == Algorithms 算法 ==
| |
| − | | |
| − | === Testing bipartiteness 二分性测试 ===
| |
| − | | |
| − | It is possible to test whether a graph is bipartite, and to return either a two-coloring (if it is bipartite) or an odd cycle (if it is not) in [[linear time]], using [[depth-first search]]. The main idea is to assign to each vertex the color that differs from the color of its parent in the depth-first search forest, assigning colors in a [[preorder traversal]] of the depth-first-search forest. This will necessarily provide a two-coloring of the [[spanning forest]] consisting of the edges connecting vertices to their parents, but it may not properly color some of the non-forest edges. In a depth-first search forest, one of the two endpoints of every non-forest edge is an ancestor of the other endpoint, and when the depth first search discovers an edge of this type it should check that these two vertices have different colors. If they do not, then the path in the forest from ancestor to descendant, together with the miscolored edge, form an odd cycle, which is returned from the algorithm together with the result that the graph is not bipartite. However, if the algorithm terminates without detecting an odd cycle of this type, then every edge must be properly colored, and the algorithm returns the coloring together with the result that the graph is bipartite.
| |
| − | | |
| − | It is possible to test whether a graph is bipartite, and to return either a two-coloring (if it is bipartite) or an odd cycle (if it is not) in linear time, using depth-first search. The main idea is to assign to each vertex the color that differs from the color of its parent in the depth-first search forest, assigning colors in a preorder traversal of the depth-first-search forest. This will necessarily provide a two-coloring of the spanning forest consisting of the edges connecting vertices to their parents, but it may not properly color some of the non-forest edges. In a depth-first search forest, one of the two endpoints of every non-forest edge is an ancestor of the other endpoint, and when the depth first search discovers an edge of this type it should check that these two vertices have different colors. If they do not, then the path in the forest from ancestor to descendant, together with the miscolored edge, form an odd cycle, which is returned from the algorithm together with the result that the graph is not bipartite. However, if the algorithm terminates without detecting an odd cycle of this type, then every edge must be properly colored, and the algorithm returns the coloring together with the result that the graph is bipartite.
| |
| − | | |
| − | 可以使用''' 深度优先搜索Depth-first search'''来测试图是否为二分图，并在线性时间内返回双色（如果是二分图）或奇数环（如果不是二分图）。其方法的主要思想是为每个顶点分配与''' 深度优先搜索林Depth-first search forest'''中其上级颜色不同的颜色，并在其中进行全部选择。这必定会为''' 生成林Spanning forest'''提供两种颜色，包括将顶点连接到其上级的边。不过它可能无法为非林边正确着色。在深度优先搜索林中，每个非林边缘的两个顶点之一是另一个顶点的始源，并且当深度优先搜索发现这种类型的边时，应检查这两个顶点是否具有不同的颜色。如果不是，则林中从始源到后代的路径与颜色不同的边一起会形成一个奇数环，该奇数环会从算法中返回，并输出非二分图的结果。但是，如果算法在未检测到此类奇数环的情况下终止，则必须对每个边进行适当的着色，并返回双色以及得出该图形为二分图的结果。
| |
| − | | |
| − | | |
| − | | |
| − | Alternatively, a similar procedure may be used with [[breadth-first search]] in place of depth-first search. Again, each node is given the opposite color to its parent in the search forest, in breadth-first order. If, when a vertex is colored, there exists an edge connecting it to a previously-colored vertex with the same color, then this edge together with the paths in the breadth-first search forest connecting its two endpoints to their [[lowest common ancestor]] forms an odd cycle. If the algorithm terminates without finding an odd cycle in this way, then it must have found a proper coloring, and can safely conclude that the graph is bipartite.
| |
| − | | |
| − | Alternatively, a similar procedure may be used with breadth-first search in place of depth-first search. Again, each node is given the opposite color to its parent in the search forest, in breadth-first order. If, when a vertex is colored, there exists an edge connecting it to a previously-colored vertex with the same color, then this edge together with the paths in the breadth-first search forest connecting its two endpoints to their lowest common ancestor forms an odd cycle. If the algorithm terminates without finding an odd cycle in this way, then it must have found a proper coloring, and can safely conclude that the graph is bipartite.
| |
| − | | |
| − | 又或者，可以使用''' 广度优先搜索Breadth-first search'''来替代深度优先搜索进行检测。同样，在搜索林中，以广度优先的顺序为每个节点赋予与上级节点相反的颜色。如果在着色某个顶点时存在一条边，其连接了与先前着色的顶点相同的颜色。然后这条边沿着以广度优先搜索林中的路径，将其两个端点与其''' 最低共有始源Lowest common ancestor'''相连，形成一条奇数环。当然，如果该算法最终没找到奇数环且终止，那么它肯定已经找到了正确的着色，可以安全返回并得出该图是二分图的结论。
| |
| − | | |
| − | | |
| − | | |
| − | For the [[intersection graph]]s of <math>n</math> [[line segment]]s or other simple shapes in the [[Euclidean plane]], it is possible to test whether the graph is bipartite and return either a two-coloring or an odd cycle in time <math>O(n\log n)</math>, even though the graph itself may have up to <math>O(n^2)</math> edges.
| |
| − | | |
| − | For the intersection graphs of <math>n</math> line segments or other simple shapes in the Euclidean plane, it is possible to test whether the graph is bipartite and return either a two-coloring or an odd cycle in time <math>O(n\log n)</math>, even though the graph itself may have up to <math>O(n^2)</math> edges.
| |
| − | | |
| − | 对于''n''个线段的相交图或''' 欧几里得平面Euclidean plane'''中的其他简单形状图，即使图本身可能具有多达''O''(''n²'')个边缘，也可以测试其是否而二分图，并在时间''O''(''n''log''n'')中返回双色（判定为二分图）或奇数环（判定为非二分图）。
| |
| − | | |
| − | === Odd cycle transversal 奇环横贯 === | |
| − | | |
| − | Odd cycle transversal is an NP-complete algorithmic problem that asks, given a graph G = (V,E) and a number k, whether there exists a set of k vertices whose removal from G would cause the resulting graph to be bipartite.[27] The problem is fixed-parameter tractable, meaning that there is an algorithm whose running time can be bounded by a polynomial function of the size of the graph multiplied by a larger function of k.[28] The name odd cycle transversal comes from the fact that a graph is bipartite if and only if it has no odd cycles. Hence, to delete vertices from a graph in order to obtain a bipartite graph, one needs to "hit all odd cycle", or find a so-called odd cycle transversal set. In the illustration, every odd cycle in the graph contains the blue (the bottommost) vertices, so removing those vertices kills all odd cycles and leaves a bipartite graph.
| |
| − | | |
| − | Odd cycle transversal is an NP-complete algorithmic problem that asks, given a graph G = (V,E) and a number k, whether there exists a set of k vertices whose removal from G would cause the resulting graph to be bipartite.[27] The problem is fixed-parameter tractable, meaning that there is an algorithm whose running time can be bounded by a polynomial function of the size of the graph multiplied by a larger function of k.[28] The name odd cycle transversal comes from the fact that a graph is bipartite if and only if it has no odd cycles. Hence, to delete vertices from a graph in order to obtain a bipartite graph, one needs to "hit all odd cycle", or find a so-called odd cycle transversal set. In the illustration, every odd cycle in the graph contains the blue (the bottommost) vertices, so removing those vertices kills all odd cycles and leaves a bipartite graph.
| |
| − | | |
| − | 奇环横贯是一个''' NP完全算法问题 NP-complete algorithmic problem'''（因不能用多项式算法而使问题无法解决的），在给定图形''G =（V，E）''和数字''k''的情况下，询问是否存在一组''k''个顶点，将其从''G''移除会导致生成为二分图。这个问题是''' 固定参数可解Fixed-parameter tractable'''的，这意味着存在一种算法，其运行时间可以由图形大小的多项式函数乘以增大系数k来确定。奇环横贯的名称源于：当且仅当图没有奇数环时，该图是二分图。因此，为了从图中删除顶点来获得二分图，就需要“命中所有奇数环”或找到所谓的奇环横贯集合。例如在图示中，图中的每个奇数环都包含蓝色（最底部）顶点，因此删除这些顶点就相当于删除了所有奇数环并留下一个二分图。
| |
| − | | |
| − | | |
| − | | |
| − | The ''edge bipartization'' problem is the algorithmic problem of deleting as few edges as possible to make a graph bipartite and is also an important problem in graph modification algorithmics. This problem is also [[fixed-parameter tractable]], and can be solved in time, where k is the number of edges to delete and m is the number of edges in the input graph.
| |
| − | | |
| − | The edge bipartization problem is the algorithmic problem of deleting as few edges as possible to make a graph bipartite and is also an important problem in graph modification algorithmics. This problem is also fixed-parameter tractable, and can be solved in time, where k is the number of edges to delete and m is the number of edges in the input graph.
| |
| − | | |
| − | '''边二分化问题 Edge bipartization problem'''是删除尽可能少的边以使其成为二分图的问题，也是图修改算法中的重要问题。此问题同样是固定参数可解的，可以在时间O(2k m2),内解决，其中''k''是要删除的边数，''m''是输入图中的边数。
| |
| | | | |
| | | | |
| | === 匹配 === | | === 匹配 === |
| | | | |
| − | A [[Matching (graph theory)|matching]] in a graph is a subset of its edges, no two of which share an endpoint. [[Polynomial time]] algorithms are known for many algorithmic problems on matchings, including [[maximum matching]] (finding a matching that uses as many edges as possible), [[maximum weight matching]], and [[stable marriage]].In many cases, matching problems are simpler to solve on bipartite graphs than on non-bipartite graphs,[31] and many matching algorithms such as the Hopcroft–Karp algorithm for maximum cardinality matching[32] work correctly only on bipartite inputs.
| + | 一个图中的匹配是其边集的一个子集，其中任意两个边均不共享一个端点。''' 多项式时间算法 Polynomial time algorithms'''素以解决很多关于匹配的算法问题而得名，包括''' 最大匹配 Maximum matching'''（查找使用尽可能多的边的匹配），''' 最大权重匹配 Maximum weight matching'''和''' 稳定婚姻问题 Stable marriage'''。<ref>{{citation | last1 = Ahuja | first1 = Ravindra K. | last2 = Magnanti | first2 = Thomas L. | last3 = Orlin | first3 = James B. |
| − | | + | | contribution = 12. Assignments and Matchings | pages = 461–509 | publisher = Prentice Hall | title = Network Flows: Theory, Algorithms, and Applications | year = 1993}}.</ref>在许多情况下，与非二分图相比，二分图上的匹配问题更容易解决，并且许多匹配算法（例如用于最大基数匹配的''' Hopcroft-Karp算法'''）<ref>{{citation|first1=John E.|last1=Hopcroft|first2=Richard M.|last2=Karp|title=An ''n''<sup>5/2</sup> algorithm for maximum matchings in bipartite graphs|journal=SIAM Journal on Computing|volume=2|issue=4|pages=225–231|year=1973|doi=10.1137/0202019}}.</ref> 仅在二分图输入的时候才能正确运行。 |
| − | A matching in a graph is a subset of its edges, no two of which share an endpoint. Polynomial time algorithms are known for many algorithmic problems on matchings, including maximum matching (finding a matching that uses as many edges as possible), maximum weight matching, and stable marriage.In many cases, matching problems are simpler to solve on bipartite graphs than on non-bipartite graphs,[31] and many matching algorithms such as the Hopcroft–Karp algorithm for maximum cardinality matching[32] work correctly only on bipartite inputs.
| |
| − | | |
| − | 一个图中的匹配是其边集的一个子集，其中任意两个边均不共享一个端点。''' 多项式时间算法 Polynomial time algorithms'''素以解决很多关于匹配的算法问题而得名，包括''' 最大匹配 Maximum matching'''（查找使用尽可能多的边的匹配），''' 最大权重匹配 Maximum weight matching'''和''' 稳定婚姻问题 Stable marriage'''。在许多情况下，与非二分图相比，二分图上的匹配问题更容易解决，并且许多匹配算法（例如用于最大基数匹配的''' Hopcroft-Karp算法'''）仅在二分图输入的时候才能正确运行。 | |
| − | | |
| − | | |
| − | As a simple example, suppose that a set <math>P</math> of people are all seeking jobs from among a set of <math>J</math> jobs, with not all people suitable for all jobs. This situation can be modeled as a bipartite graph <math>(P,J,E)</math> where an edge connects each job-seeker with each suitable job.<ref>{{harvtxt|Ahuja|Magnanti|Orlin|1993}}, Application 12.1 Bipartite Personnel Assignment, pp. 463–464.</ref> A [[perfect matching]] describes a way of simultaneously satisfying all job-seekers and filling all jobs; [[Hall's marriage theorem]] provides a characterization of the bipartite graphs which allow perfect matchings. The [[National Resident Matching Program]] applies graph matching methods to solve this problem for [[Medical education in the United States|U.S. medical student]] job-seekers and [[Residency (medicine)|hospital residency]] jobs.
| |
| − | | |
| − | | |
| − | 举一个简单的例子，假设一组<math>P</math>的所有人都在一组<math>J</math>的职位中寻找工作，但并不是所有人都适合所有职位。可以将这种情况建模为一个二分图<math>(P,J,E)</math>，其中当每个求职者找到其合适的工作时产生的关系就作为连边。一个完美的匹配描述的是所有求职者同时找到所有工作的情况；''' 霍尔的婚姻定理Hall's marriage theorem'''阐述的就是二分图允许完美匹配的特征。美国国民住院医师匹配项目采用的就是图形匹配法来解决美国医学生求职者和医院实习工作的匹配问题。
| |
| − | | |
| | | | |
| | | | |
| − | The [[Dulmage–Mendelsohn decomposition]] is a structural decomposition of bipartite graphs that is useful in finding maximum matchings.<ref>{{harvtxt|Dulmage|Mendelsohn|1958}}.</ref>
| + | 举一个简单的例子，假设一组<math>P</math>的所有人都在一组<math>J</math>的职位中寻找工作，但并不是所有人都适合所有职位。可以将这种情况建模为一个二分图<math>(P,J,E)</math>，其中当每个求职者找到其合适的工作时产生的关系就作为连边。<ref>{{harvtxt|Ahuja|Magnanti|Orlin|1993}}, Application 12.1 Bipartite Personnel Assignment, pp. 463–464.</ref>一个完美的匹配描述的是所有求职者同时找到所有工作的情况；''' 霍尔的婚姻定理 Hall's marriage theorem'''阐述的就是二分图允许完美匹配的特征。美国国民住院医师匹配项目采用的就是图形匹配法来解决美国医学生求职者和医院实习工作的匹配问题。 |
| | | | |
| − | The Dulmage–Mendelsohn decomposition is a structural decomposition of bipartite graphs that is useful in finding maximum matchings.
| |
| | | | |
| − | '''Dulmage–Mendelsohn 分解'''是二分图的结构分解，可用于寻找最大匹配。 | + | '''Dulmage–Mendelsohn 分解'''是二分图的结构分解，可用于寻找最大匹配。<ref>{{harvtxt|Dulmage|Mendelsohn|1958}}.</ref> |
| | | | |
| | | | |
| 第259行： |
第156行： |
| | * [https://academic.oup.com/gigascience/article/7/4/giy014/4875933/ 系统生物学和医学中的二分图] | | * [https://academic.oup.com/gigascience/article/7/4/giy014/4875933/ 系统生物学和医学中的二分图] |
| | | | |
| | + | |
| | + | |
| | + | ==编辑推荐== |
| | + | ===集智课程=== |
| | + | ====[]==== |
| | | | |
| | | | |