The parameterised complexity of computing the maximum modularity of a graph (Q6304366)
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: The parameterised complexity of computing the maximum modularity of a graph |
scientific article; zbMATH DE number 7378595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parameterised complexity of computing the maximum modularity of a graph |
scientific article; zbMATH DE number 7378595 |
Statements
18 July 2018
0 references
cs.DS
0 references
cs.CC
0 references
math.CO
0 references
