On the complexity of minimum maximal acyclic matchings (Q6168934)
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 7724737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minimum maximal acyclic matchings |
scientific article; zbMATH DE number 7724737 |
Statements
On the complexity of minimum maximal acyclic matchings (English)
0 references
10 August 2023
0 references
matching
0 references
acyclic matching
0 references
minimum maximal acyclic matching
0 references
\textsf{NP}-completeness
0 references
\textsf{APX}-hardness
0 references
0 references
0 references
0 references
