The Parameterised Complexity of Computing the Maximum Modularity of a Graph

Kitty Meeks, Fiona Skerman. The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica, 82(8):2174-2199, 2020. [doi]

Authors

Kitty Meeks

This author has not been identified. Look up 'Kitty Meeks' in Google

Fiona Skerman

This author has not been identified. Look up 'Fiona Skerman' in Google