Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644)
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: Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors |
scientific article; zbMATH DE number 7333143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors |
scientific article; zbMATH DE number 7333143 |
Statements
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (English)
0 references
14 April 2021
0 references
algebraic algorithms
0 references
matchings
0 references
factors
0 references
shortest paths
0 references
0 references
