On the complexity of minimum maximal uniquely restricted matching (Q5925665)
From MaRDI portal
scientific article; zbMATH DE number 7666361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum maximal uniquely restricted matching |
scientific article; zbMATH DE number 7666361 |
Statements
On the complexity of minimum maximal uniquely restricted matching (English)
0 references
21 March 2023
0 references
matching
0 references
uniquely restricted matching
0 references
minimum maximal matching
0 references
graph algorithms
0 references
NP-completeness
0 references
\textsf{APX}-completeness
0 references
