Acyclic matching in some subclasses of graphs (Q2680984)
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 7638584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic matching in some subclasses of graphs |
scientific article; zbMATH DE number 7638584 |
Statements
Acyclic matching in some subclasses of graphs (English)
0 references
5 January 2023
0 references
matching
0 references
acyclic matching
0 references
graph algorithms
0 references
\( \mathsf{NP} \)-completeness
0 references
polynomial-time algorithms
0 references
\( \mathsf{APX} \)-completeness
0 references
0.9082043766975404
0 references
0.8624135255813599
0 references
0.8310294151306152
0 references
0.7887603640556335
0 references
0.7773625254631042
0 references
