The parameterised complexity of computing the maximum modularity of a graph

Meeks, K. and Skerman, F. (2019) The parameterised complexity of computing the maximum modularity of a graph. Algorithmica, (Accepted for Publication)

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

399kB

Abstract

No abstract available.

Item Type:Articles
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
Journal Name:Algorithmica
Publisher:Springer
ISSN:0178-4617
ISSN (Online):1432-0541

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