scientific article; zbMATH DE number 7378595

DOI10.4230/LIPIcs.IPEC.2018.9MaRDI QIDQ5009471

Fiona Skerman, Kitty Meeks

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1807.06965

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pathwidthmodularityvertex covercommunity detectioninteger quadratic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Related Items (1)

Modularity of Erdős‐Rényi random graphs

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Modularity in several random graph models
• On the complexity of Newman's community finding approach for biological and social networks
• Asymptotic Modularity of Some Graph Classes
• Modularity of regular and treelike graphs
• Communities in Networks
• What Makes Equitable Connected Partition Easy
• Additive Approximation Algorithms for Modularity Maximization
• Modularity of Erdős‐Rényi random graphs
• Fast unfolding of communities in large networks
• Parameterized Algorithms

This page was built for publication: