Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(n^2.5)
|
| gptkbp:designedFor |
maximum matching in bipartite graphs
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Sahni-Mishra algorithm
|
| gptkbp:namedAfter |
gptkb:Sartaj_Sahni
K. Mishra |
| gptkbp:publicationYear |
1976
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Hopcroft–Karp_algorithm
|
| gptkbp:bfsParent |
gptkb:Sahni_and_Mishra
|
| gptkbp:bfsLayer |
6
|