Publisher review:Hopcroft-Karp bipartite matching script takes as input a bipartite graph, and outputs both a maximum matching and a maximum independent set. This script takes as input a bipartite graph in a variation of Guido van Rossum's dictionary-of-lists format, and outputs both a maximum matching (largest possible set of nonadjacent edges) and a maximum independent set (largest possible set of nonadjacent vertices).
The running time in the worst case is O(E sqrt(V)) but for many graphs it runs faster due to doing fewer than the worst case number of iterations.
Hopcroft-Karp bipartite matching 1.0 is a Python script for Programming Methods and Algorithms scripts design by David Eppstein.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Hopcroft-Karp bipartite matching script takes as input a bipartite graph, and outputs both a maximum matching and a maximum independent set.
Operating system:Windows / Linux / Mac OS / BSD / Solaris
Hopcroft-Karp bipartite matching 1.0 script details 
