The parameterised complexity of computing the maximum modularity of a graph (Q786031)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parameterised complexity of computing the maximum modularity of a graph |
scientific article |
Statements
The parameterised complexity of computing the maximum modularity of a graph (English)
0 references
12 August 2020
0 references
modularity
0 references
community detection
0 references
integer quadratic programming
0 references
vertex cover
0 references
pathwidth
0 references
0 references
