Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56341084, #quickstatements; #temporary_batch_1708296850199 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56341084 / rank | |||
Normal rank | |||
Revision as of 00:06, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
