Complexity of dissociate set problems in some hereditary classes of graphs (Q2837376)
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 6186515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of dissociate set problems in some hereditary classes of graphs |
scientific article; zbMATH DE number 6186515 |
Statements
10 July 2013
0 references
maximal dissociation set problem
0 references
NP-hard
0 references
planar line graphs
0 references
planar bipartite graphs
0 references
Complexity of dissociate set problems in some hereditary classes of graphs (English)
0 references
0.9589341282844543
0 references
0.8490889668464661
0 references
0.8279284238815308
0 references
0.8217675685882568
0 references
0.8068943619728088
0 references
