Efficient algorithms for finding maximum matching in graphs (Q3745302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3980509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for finding maximum matching in graphs |
scientific article; zbMATH DE number 3980509 |
Statements
Efficient algorithms for finding maximum matching in graphs (English)
0 references
1986
0 references
graph algorithms
0 references
weighted matching
0 references
0.8579972386360168
0 references
0.8479579091072083
0 references
0.845165491104126
0 references
