Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6034859 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bipartite graphs | |||
| Property / zbMATH Keywords: bipartite graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
perfect matchings | |||
| Property / zbMATH Keywords: perfect matchings / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum matchings | |||
| Property / zbMATH Keywords: maximum matchings / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximally-matchable edges | |||
| Property / zbMATH Keywords: maximally-matchable edges / rank | |||
Normal rank | |||
Revision as of 21:02, 29 June 2023
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
