Moderately exponential time algorithms for the maximum induced matching problem (Q2355320)
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: Moderately exponential time algorithms for the maximum induced matching problem |
scientific article; zbMATH DE number 6461578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Moderately exponential time algorithms for the maximum induced matching problem |
scientific article; zbMATH DE number 6461578 |
Statements
Moderately exponential time algorithms for the maximum induced matching problem (English)
0 references
22 July 2015
0 references
induced matching
0 references
branch and reduce
0 references
measure and conquer
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.8774780631065369
0 references
0.8702720403671265
0 references
0.7957311868667603
0 references
0.7945427894592285
0 references
