Hopcroft-Karp Algorithm

Hopcroft-Karp Algorithm

Edited by 

List price: US$38.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


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.show more

Product details

  • Paperback | 52 pages
  • 152 x 229 x 3mm | 91g
  • Volvpress
  • United States
  • English
  • black & white illustrations
  • 613627521X
  • 9786136275215