Facts
Urlhttps://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm
Sources
Wikipedia: Hopcroft-Karp algorithm
Lead sectionQuote, Lead section
In computer science, the Hopcroft-Karp algorithm (sometimes more accurately called the Hopcroft-Karp-Karzanov algorithm) is an algorithm that takes a bipartite graph as input and produces a maximum-cardinality matching as output - a set of as many edges as possible with the property that no two edges share an endpoint.
Claims Backed By This Source (6 claims)
This source backs 6 claims across the atlas. As facts: 2 well-attested. As cited relationships: 3 holds. Plus 1 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 5 claims: 1 well-attested, 3 holds, 1 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.