The Parameterised Complexity of Computing the Maximum Modularity of a Graph

Meeks, K. and Skerman, F. (2018) The Parameterised Complexity of Computing the Maximum Modularity of a Graph. In: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Helsinki, Finland, 22-24 Aug 2018, (Accepted for Publication)

[img] Text
166003.pdf - Accepted Version
Restricted to Repository staff only

515kB

Abstract

No abstract available.

Item Type:Conference Proceedings
Status:Accepted for Publication
Refereed:Yes
Glasgow Author(s) Enlighten ID:Meeks, Dr Kitty
Authors: Meeks, K., and Skerman, F.
College/School:College of Science and Engineering > School of Computing Science
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record