A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem (Q4837647)
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 769275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem |
scientific article; zbMATH DE number 769275 |
Statements
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem (English)
0 references
3 July 1995
0 references
strong spanning trees
0 references
maximum matching
0 references
bipartite graphs
0 references
augmenting path
0 references
0.9001942873001099
0 references
0.8132657408714294
0 references
0.7959488034248352
0 references
0.7847414612770081
0 references
0.7821435332298279
0 references
