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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.