The hardness of the independence and matching clutter of a graph (Q2805262)
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: The hardness of the independence and matching clutter of a graph |
scientific article; zbMATH DE number 6578888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of the independence and matching clutter of a graph |
scientific article; zbMATH DE number 6578888 |
Statements
The hardness of the independence and matching clutter of a graph (English)
0 references
10 May 2016
0 references
clutter
0 references
hardness
0 references
independent set
0 references
maximal independent set
0 references
matching
0 references
maximal matching
0 references
0.9251331090927124
0 references
0.7486364841461182
0 references
0.7154645919799805
0 references
