A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144090114 / rank | |||
Normal rank | |||
Revision as of 21:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the hardness results for the labeled perfect matching problems in bipartite graphs |
scientific article |
Statements
A note on the hardness results for the labeled perfect matching problems in bipartite graphs (English)
0 references
29 January 2009
0 references
labeled matching
0 references
bipartite graphs
0 references
approximation and complexity
0 references
inapproximation bounds
0 references
