On the complexity of minimum maximal uniquely restricted matching (Q5918362)
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 7380857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9623561
0 references
0.9288082
0 references
0.9223169
0 references
0.9084554
0 references
0.90658426
0 references
0.8981885
0 references
0.8973535
0 references
