"The Parameterised Complexity of Computing the Maximum Modularity of a Graph."

Kitty Meeks, Fiona Skerman (2020)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00649-7

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/MeeksS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/MeeksS20
Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica 82(8): 2174-2199 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.