Acyclic Matching in Some Subclasses of Graphs (Q5041209)
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 7601024
| 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 7601024 |
Statements
Acyclic Matching in Some Subclasses of Graphs (English)
0 references
13 October 2022
0 references
matching
0 references
bipartite graphs
0 references
chordal graphs
0 references
graph algorithm
0 references
NP-completeness
0 references
approximation algorithm
0 references
0.9800234436988832
0 references
0.9232303500175476
0 references
0.8934736847877502
0 references
0.8859667181968689
0 references
0.8757767081260681
0 references
