Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
graph theory
maximum matching |
| gptkbp:complexity |
polynomial time
|
| gptkbp:field |
computer science
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Vazirani's algorithm
|
| gptkbp:namedAfter |
gptkb:Vijay_Vazirani
|
| gptkbp:publicationYear |
1994
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Edmonds'_blossom_algorithm
|
| gptkbp:usedFor |
finding maximum matching in general graphs
|
| gptkbp:bfsParent |
gptkb:Vijay_V._Vazirani
|
| gptkbp:bfsLayer |
7
|