Maximum matchings in bipartite graphs via strong spanning trees (Q3211115)
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 4191407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum matchings in bipartite graphs via strong spanning trees |
scientific article; zbMATH DE number 4191407 |
Statements
Maximum matchings in bipartite graphs via strong spanning trees (English)
0 references
1991
0 references
bipartite graphs
0 references
maximum matchings
0 references
strong spanning trees
0 references
0.9413499
0 references
0.92018485
0 references
0.9182014
0 references
0.9115764
0 references
0.90652454
0 references
0.90262854
0 references
0.9005885
0 references
0.8993571
0 references
0 references
