An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (Q3718168): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Zvi Galil / rank | |||
| Property / author | |||
| Property / author: Zvi Galil / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0215009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040326319 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:36, 19 March 2024
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
