An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth (Q5207854)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7150563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth |
scientific article; zbMATH DE number 7150563 |
Statements
13 January 2020
0 references
combinatorial optimization
0 references
vertex cover \(P_3\) problem
0 references
connected vertex cover \(P_3\) problem
0 references
treewidth
0 references
dynamic programming
0 references
0.880807638168335
0 references
0.8766783475875854
0 references
0.8410947322845459
0 references
0.8301873803138733
0 references
0.8292138576507568
0 references
