Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444)
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: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems |
scientific article; zbMATH DE number 6680877
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems |
scientific article; zbMATH DE number 6680877 |
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
0.9485605
0 references
0.9346009
0 references
0.9033395
0 references
0.9016823
0 references
0.89592814
0 references
0.89170504
0 references
0 references
0.8872826
0 references
0.8865372
0 references
