Combinatorica Package >

BipartiteMatchingAndCover

BipartiteMatchingAndCover[g]
takes a bipartite graph 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 .
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF