Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs |
scientific article |
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
