An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (Q3718168)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs |
scientific article |
Statements
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (English)
0 references
1986
0 references
augmenting path
0 references
blossoms
0 references
primal dual algorithm
0 references
time complexity
0 references
priority queue
0 references
