Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228)
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: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 |
scientific article; zbMATH DE number 5569516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 |
scientific article; zbMATH DE number 5569516 |
Statements
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (English)
0 references
24 June 2009
0 references
maximum independent set
0 references
exact exponential algorithms
0 references
vertex cover
0 references
parameterized complexity
0 references
0 references
