Kitty Meeks, Fiona Skerman. The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica, 82(8):2174-2199, 2020. [doi]
@article{MeeksS20,
title = {The Parameterised Complexity of Computing the Maximum Modularity of a Graph},
author = {Kitty Meeks and Fiona Skerman},
year = {2020},
doi = {10.1007/s00453-019-00649-7},
url = {https://doi.org/10.1007/s00453-019-00649-7},
researchr = {https://researchr.org/publication/MeeksS20},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2174-2199},
}