Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087)
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: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques |
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms parameterized by vertex cover and modular width, through potential maximal cliques |
No description defined |
Statements
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (English)
0 references
23 May 2018
0 references
parametrized algorithms
0 references
potential maximal cliques
0 references
treewidth
0 references
vertex cover
0 references
