Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems |
scientific article |
Statements
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (English)
0 references
6 February 2017
0 references
exact algorithm
0 references
graph algorithm
0 references
dissociation number
0 references
3-path vertex cover
0 references
dynamic programming
0 references
0 references
