OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Hopcroft–Karp algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Graph algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Hopcroft–Karp algorithm is a classic algorithm used to find the maximum matching in a bipartite graph. A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other set. The algorithm works in two main phases: 1. **BFS Phase**: It performs a breadth-first search (BFS) to find the shortest augmenting paths.

 Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook