Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs (Q3452575)
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: Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs |
scientific article; zbMATH DE number 6508069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs |
scientific article; zbMATH DE number 6508069 |
Statements
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (English)
0 references
12 November 2015
0 references
dissociation number
0 references
3-path vertex cover
0 references
exact algorithms
0 references
graph algorithms
0 references
dynamic programming
0 references
0.9738266468048096
0 references
0.90658038854599
0 references
0.8173505663871765
0 references
0.8035430908203125
0 references
0.7905318737030029
0 references
