Implementation of hopcroft-karp algorithm in python. Hopcroft-Karp bipartite max-cardinality matching and max independent set. 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
References in zbMATH (referenced in 1 article )
Showing result 1 of 1.
- Gent, Ian P.; Miguel, Ian; Nightingale, Peter: Generalised arc consistency for the AllDifferent constraint: an empirical survey (2008)