An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs |
scientific article |
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
