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 the normal view instead:
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterised complexity of computing the maximum modularity of a graph |
scientific article |
Statements
18 July 2018
0 references
cs.DS
0 references
cs.CC
0 references
math.CO
0 references
