Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:theorem
|
| gptkbp:describes |
maximum matching in bipartite graphs
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hopcroft's theorem
|
| gptkbp:is_applicable_to |
network flow problems
|
| gptkbp:is_debated_in |
existence of a perfect matching under certain conditions
|
| gptkbp:is_related_to |
König's theorem
|
| gptkbp:is_taught_in |
computer science courses
|
| gptkbp:is_used_in |
graph theory
|
| gptkbp:key |
combinatorial optimization
|
| gptkbp:named_after |
gptkb:John_Hopcroft
|
| gptkbp:published_by |
gptkb:1973
|
| gptkbp:bfsParent |
gptkb:John_E._Hopcroft
|
| gptkbp:bfsLayer |
5
|