An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969)
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: An algorithm for finding a maximum t-matching excluding complete partite subgraphs |
scientific article; zbMATH DE number 6080922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs |
scientific article; zbMATH DE number 6080922 |
Statements
An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (English)
0 references
11 September 2012
0 references
b-matching
0 references
complete partite graph
0 references
polynomial-time algorithm
0 references
shrinking
0 references
0 references
0.8463258147239685
0 references
0.8197218179702759
0 references
0.8126780986785889
0 references
0.8106083273887634
0 references
0.8068819046020508
0 references
