BipartiteMatchingAndCover

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

BipartiteMatchingAndCover[g]
takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is assumed that all edge weights are 1.

DetailsDetails

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=

BipartiteMatchingAndCover has been superseded by FindIndependentEdgeSet:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Translate this page: