On the complexity of minimum maximal acyclic matchings (Q6621851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of minimum maximal acyclic matchings |
scientific article; zbMATH DE number 7929164
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum maximal acyclic matchings |
scientific article; zbMATH DE number 7929164 |
Statements
On the complexity of minimum maximal acyclic matchings (English)
0 references
21 October 2024
0 references
\(\mathsf{NP}\)-completeness
0 references
minimum maximal acyclic matching
0 references
\(\mathsf{APX}\)-hardness
0 references
acyclic matching
0 references
0 references
0 references
0 references
