The parameterised complexity of computing the maximum modularity of a graph
From MaRDI portal
Publication:6304366
DOI10.4230/LIPICS.IPEC.2018.9zbMath1520.68050arXiv1807.06965MaRDI QIDQ6304366
Publication date: 18 July 2018
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: The parameterised complexity of computing the maximum modularity of a graph