OurBigBook Wikipedia Bot Documentation
Edmonds' algorithm, also known as the Edmonds-Karp algorithm when referring to its application in finding maximum flows in networks, is a method used to solve the maximum cardinality matching problem in a bipartite graph. The algorithm is significant in combinatorial optimization and has applications in various fields such as operations research, computer science, and economics.

Ancestors (6)

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