Finding all maximally-matchable edges in a bipartite graph (Q418005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding all maximally-matchable edges in a bipartite graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding all maximally-matchable edges in a bipartite graph |
scientific article |
Statements
Finding all maximally-matchable edges in a bipartite graph (English)
0 references
14 May 2012
0 references
bipartite graphs
0 references
perfect matchings
0 references
maximum matchings
0 references
maximally-matchable edges
0 references
0 references
0.8759682774543762
0 references
0.8429872989654541
0 references
0.8308653235435486
0 references
0.8261904716491699
0 references
