#14 Bipartite Problem

#14.1 Decide whether a given undirected graph is a bipartite graph

Algorithm

BFS

Java IsBipartite

TODO

1
2

Python IsBipartite

1
2

#14.2 Maximum Cardinality Bipartite Matching (MCBM)

Some examples of unweighted bipartite matching problem that could use maximum flow algorithm, like Ford-Fulkerson to solve:

  • Mice and Owls problem
  • Book selection problem
  • Elementary Math problem

Comments

01/03/2020