The complexity of dissociation set problems in graphs (Q2275943)
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 5937816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of dissociation set problems in graphs |
scientific article; zbMATH DE number 5937816 |
Statements
The complexity of dissociation set problems in graphs (English)
0 references
10 August 2011
0 references
dissociation set
0 references
computational complexity
0 references
forbidden induced subgraph
0 references
approximability
0 references
0 references
0 references
0.93973434
0 references
0.9140799
0 references
0.8951794
0 references
0 references
0.89028716
0 references
0.89028716
0 references
0.8895332
0 references
0.88942975
0 references
0 references
0.8875674
0 references
