Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:47, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms parameterized by vertex cover and modular width, through potential maximal cliques |
scientific article |
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
