Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (Q4033760)
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 Degree Constrained Graph Factors of Minimum Deficiency |
scientific article; zbMATH DE number 166203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for Degree Constrained Graph Factors of Minimum Deficiency |
scientific article; zbMATH DE number 166203 |
Statements
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (English)
0 references
16 May 1993
0 references
minimum deficiency
0 references
\((g,f)\)-factor
0 references
\(g\)-deficiency
0 references
perfect matching
0 references
efficient algorithm
0 references
bipartite matching algorithm
0 references
complexity
0 references
upper bounds
0 references
maximum flow problem
0 references
bipartite graphs
0 references
complexity bounds
0 references
maximum flow algorithms
0 references
NP-hard
0 references
0.8890135884284973
0 references
0.8812143206596375
0 references
0.8414803743362427
0 references
0.8205280303955078
0 references
