On the complexity of minimum maximal uniquely restricted matching (Q5918362)
From MaRDI portal
scientific article; zbMATH DE number 7380857
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum maximal uniquely restricted matching |
scientific article; zbMATH DE number 7380857 |
Statements
On the complexity of minimum maximal uniquely restricted matching (English)
0 references
11 August 2021
0 references
matching
0 references
uniquely restricted matching
0 references
graph algorithms
0 references
\( \mathsf{NP} \)-completeness
0 references
polynomial time algorithms
0 references
\( \mathsf{APX} \)-completeness
0 references
0 references
