Hopcroft-Karp Algorithm (Paperback)

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the Hopcroft-Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching - a set of as many edges as possible with the property that no two edges share an endpoint. It runs in O time in the worst case, where "O" refers to big O notation, m is the number of edges in the graph, and n is the number of vertices of the graph. In the case of dense graphs the time bound becomes O, and for random graphs it runs in near-linear time.