Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6398349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning to three matchings of given size is NP-complete for bipartite graphs |
scientific article; zbMATH DE number 6398349 |
Statements
Partitioning to three matchings of given size is NP-complete for bipartite graphs (English)
0 references
5 February 2015
0 references
NP-completeness
0 references
disjoint matchings
0 references
bipartite graphs
0 references
partitioning
0 references
0.8662960529327393
0 references
0.8382086157798767
0 references
0.8241269588470459
0 references
0.8213836550712585
0 references
0.8167551159858704
0 references
