Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/Tassa12, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/Tassa12 / rank | |||
Normal rank | |||
Latest revision as of 04:33, 13 November 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
0 references
