Unique maximum matching algorithms (Q2746432)
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 1656028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique maximum matching algorithms |
scientific article; zbMATH DE number 1656028 |
Statements
8 April 2002
0 references
maximum matchings
0 references
perfect matching
0 references
dynamic connectivity algorithm
0 references
planar graphs
0 references
blossom-shrinking algorithm
0 references
depth-first search
0 references
Kotzig's theorem
0 references
\(f\)-factor
0 references
Unique maximum matching algorithms (English)
0 references
0.993084192276001
0 references
0.8190847635269165
0 references
0.8150871396064758
0 references
0.8047621250152588
0 references
0.8037816882133484
0 references
