Complexity of a disjoint matching problem on bipartite graphs (Q2629777): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1506.06157 / rank | |||
Normal rank | |||
Revision as of 07:19, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of a disjoint matching problem on bipartite graphs |
scientific article |
Statements
Complexity of a disjoint matching problem on bipartite graphs (English)
0 references
7 July 2016
0 references
matchings
0 references
edge coloring
0 references
computational complexity
0 references
NP-hardness
0 references
bipartite graphs
0 references
