A faster FPT algorithm for 3-path vertex cover (Q903365)
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: A faster FPT algorithm for 3-path vertex cover |
scientific article; zbMATH DE number 6526577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster FPT algorithm for 3-path vertex cover |
scientific article; zbMATH DE number 6526577 |
Statements
A faster FPT algorithm for 3-path vertex cover (English)
0 references
5 January 2016
0 references
fixed-parameter algorithm
0 references
path vertex cover
0 references
dissociation number
0 references
branch and reduce
0 references
analysis of algorithms
0 references
computational complexity
0 references
graph algorithms
0 references
0 references
0.90489334
0 references
0.8986626
0 references
0.8983987
0 references
0.8932038
0 references
0.8922648
0 references
0.8889056
0 references
0.88663733
0 references
0.8835767
0 references
