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

Kitty Meeks, Fiona Skerman (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2018.9

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/MeeksS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/MeeksS18
Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC 2018: 9:1-9:14

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.