On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941)
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: On computing the minimum 3-path vertex cover and dissociation number of graphs |
scientific article; zbMATH DE number 5987018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the minimum 3-path vertex cover and dissociation number of graphs |
scientific article; zbMATH DE number 5987018 |
Statements
On computing the minimum 3-path vertex cover and dissociation number of graphs (English)
0 references
7 December 2011
0 references
path vertex cover
0 references
dissociation number
0 references
approximation
0 references
0.915186643600464
0 references
0.90658038854599
0 references
0.8339256644248962
0 references
0.8134779334068298
0 references
0.8087287545204163
0 references
