Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): conf/swat/FominLMT14, #quickstatements; #temporary_batch_1731462974821 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/swat/FominLMT14 / rank | |||
Normal rank | |||
Latest revision as of 03:05, 13 November 2024
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
