Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087)
From MaRDI portal
(Redirected from Item:Q3188893)
 | 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 |
scientific article; zbMATH DE number 6339257
- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms parameterized by vertex cover and modular width, through potential maximal cliques |
scientific article; zbMATH DE number 6339257 |
|
Statements
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (English)
0 references
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English)
0 references
23 May 2018
0 references
2 September 2014
0 references
parametrized algorithms
0 references
potential maximal cliques
0 references
treewidth
0 references
vertex cover
0 references
0 references
0 references
0.982662320137024
0 references
0.8086766600608826
0 references
0.8040325045585632
0 references
0.7780730128288269
0 references
