Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
bipartite graphs
|
| gptkbp:complexity |
O(√n * m)
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Hopcroft–Karp algorithm
|
| gptkbp:improves |
previous matching algorithms
|
| gptkbp:input |
bipartite graph
|
| gptkbp:introducedIn |
1973
|
| gptkbp:namedAfter |
gptkb:John_Hopcroft
gptkb:Richard_Karp |
| gptkbp:output |
maximum matching
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:solvedBy |
maximum cardinality matching problem
|
| gptkbp:uses |
gptkb:breadth-first_search
depth-first search |
| gptkbp:bfsParent |
gptkb:Richard_M._Karp
|
| gptkbp:bfsLayer |
4
|