The parameterised complexity of computing the maximum modularity of a graph
type: Item
instance of: scholarly article
title: The parameterised complexity of computing the maximum modularity of a graph
zbMATH Open document ID: 1452.68091
author: Kitty Meeks
author: Fiona Skerman
published in: Algorithmica
publication date: 2020-08-12T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7233373
zbMATH Keywords: modularity
zbMATH Keywords: community detection
zbMATH Keywords: integer quadratic programming
zbMATH Keywords: vertex cover
zbMATH Keywords: pathwidth
describes a project that uses: GenLouvain
MaRDI profile type: Publication
full work available at URL: s00453-019-00649-7
OpenAlex ID: W2963890422
Wikidata QID: Q126864762
cites work: Fast unfolding of communities in large networks
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: Parameterized Algorithms
cites work: On the complexity of Newman's community finding approach for biological and social networks
cites work: Fundamentals of parameterized complexity
cites work: What Makes Equitable Connected Partition Easy
cites work: Q3570028
cites work: Additive Approximation Algorithms for Modularity Maximization
cites work: Treewidth. Computations and approximations
cites work: Modularity of regular and treelike graphs
cites work: Modularity of Erdős‐Rényi random graphs
cites work: Q4993553
cites work: Communities in Networks
cites work: Modularity in several random graph models
DOI: 10.1007/S00453-019-00649-7
description: scientific article; zbMATH DE number 7233373